./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN --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-6b4ec56 [2022-11-20 12:45:28,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:45:28,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:45:28,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:45:28,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:45:28,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:45:28,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:45:28,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:45:28,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:45:28,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:45:28,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:45:28,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:45:28,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:45:28,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:45:28,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:45:28,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:45:28,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:45:28,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:45:28,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:45:28,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:45:28,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:45:28,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:45:28,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:45:28,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:45:28,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:45:28,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:45:28,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:45:28,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:45:28,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:45:28,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:45:28,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:45:28,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:45:28,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:45:28,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:45:28,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:45:28,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:45:28,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:45:28,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:45:28,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:45:28,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:45:28,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:45:28,378 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 12:45:28,422 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:45:28,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:45:28,424 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:45:28,424 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:45:28,426 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:45:28,427 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:45:28,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:45:28,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:45:28,428 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:45:28,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:45:28,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:45:28,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:45:28,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:45:28,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:45:28,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:45:28,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:45:28,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:45:28,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:45:28,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:45:28,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:45:28,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:45:28,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:45:28,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:45:28,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:45:28,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:45:28,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:45:28,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:45:28,434 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:45:28,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:45:28,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:45:28,435 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_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN 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-20 12:45:28,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:45:28,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:45:28,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:45:28,812 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:45:28,812 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:45:28,814 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2022-11-20 12:45:32,051 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:45:32,309 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:45:32,310 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2022-11-20 12:45:32,317 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/data/31e323ff4/7cf0ab9961074c00917745dbc87b8e03/FLAGc1500eea7 [2022-11-20 12:45:32,334 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/data/31e323ff4/7cf0ab9961074c00917745dbc87b8e03 [2022-11-20 12:45:32,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:45:32,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:45:32,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:45:32,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:45:32,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:45:32,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:45:32" (1/1) ... [2022-11-20 12:45:32,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54984df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:32, skipping insertion in model container [2022-11-20 12:45:32,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:45:32" (1/1) ... [2022-11-20 12:45:32,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:45:32,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:45:32,590 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c[1292,1305] [2022-11-20 12:45:32,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:45:32,653 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:45:32,672 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c[1292,1305] [2022-11-20 12:45:32,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:45:32,714 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:45:32,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:32 WrapperNode [2022-11-20 12:45:32,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:45:32,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:45:32,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:45:32,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:45:32,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:32" (1/1) ... [2022-11-20 12:45:32,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:32" (1/1) ... [2022-11-20 12:45:32,771 INFO L138 Inliner]: procedures = 11, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2022-11-20 12:45:32,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:45:32,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:45:32,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:45:32,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:45:32,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:32" (1/1) ... [2022-11-20 12:45:32,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:32" (1/1) ... [2022-11-20 12:45:32,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:32" (1/1) ... [2022-11-20 12:45:32,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:32" (1/1) ... [2022-11-20 12:45:32,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:32" (1/1) ... [2022-11-20 12:45:32,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:32" (1/1) ... [2022-11-20 12:45:32,809 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:32" (1/1) ... [2022-11-20 12:45:32,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:32" (1/1) ... [2022-11-20 12:45:32,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:45:32,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:45:32,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:45:32,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:45:32,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:32" (1/1) ... [2022-11-20 12:45:32,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:45:32,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:45:32,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:45:32,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:45:32,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:45:32,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:45:32,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 12:45:32,920 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 12:45:33,016 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:45:33,020 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:45:33,257 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:45:33,276 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:45:33,276 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 12:45:33,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:45:33 BoogieIcfgContainer [2022-11-20 12:45:33,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:45:33,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:45:33,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:45:33,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:45:33,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:45:32" (1/3) ... [2022-11-20 12:45:33,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a05f031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:45:33, skipping insertion in model container [2022-11-20 12:45:33,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:32" (2/3) ... [2022-11-20 12:45:33,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a05f031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:45:33, skipping insertion in model container [2022-11-20 12:45:33,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:45:33" (3/3) ... [2022-11-20 12:45:33,295 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2022-11-20 12:45:33,379 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:45:33,380 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:45:33,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:45:33,466 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;@6193e014, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:45:33,479 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:45:33,484 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-20 12:45:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 12:45:33,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:33,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:33,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:33,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2022-11-20 12:45:33,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:33,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915320180] [2022-11-20 12:45:33,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:33,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:34,128 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-20 12:45:34,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:34,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915320180] [2022-11-20 12:45:34,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915320180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:34,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:34,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:45:34,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051564037] [2022-11-20 12:45:34,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:34,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:45:34,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:34,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:45:34,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:45:34,179 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-20 12:45:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:34,313 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2022-11-20 12:45:34,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:45:34,316 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-20 12:45:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:34,326 INFO L225 Difference]: With dead ends: 38 [2022-11-20 12:45:34,326 INFO L226 Difference]: Without dead ends: 23 [2022-11-20 12:45:34,330 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-20 12:45:34,335 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:34,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 45 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:45:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-20 12:45:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2022-11-20 12:45:34,382 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-20 12:45:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-11-20 12:45:34,387 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 7 [2022-11-20 12:45:34,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:34,388 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-11-20 12:45:34,389 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-20 12:45:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-11-20 12:45:34,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 12:45:34,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:34,391 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:34,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:45:34,392 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:34,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:34,397 INFO L85 PathProgramCache]: Analyzing trace with hash 679252028, now seen corresponding path program 1 times [2022-11-20 12:45:34,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:34,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543635876] [2022-11-20 12:45:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:35,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:35,042 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-20 12:45:35,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:35,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543635876] [2022-11-20 12:45:35,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543635876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:35,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:35,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:45:35,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737157243] [2022-11-20 12:45:35,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:35,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:45:35,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:35,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:45:35,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:45:35,057 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-20 12:45:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:35,157 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-11-20 12:45:35,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:45:35,158 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-20 12:45:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:35,159 INFO L225 Difference]: With dead ends: 31 [2022-11-20 12:45:35,159 INFO L226 Difference]: Without dead ends: 29 [2022-11-20 12:45:35,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-20 12:45:35,161 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:35,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 65 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:45:35,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-20 12:45:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-11-20 12:45:35,170 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-20 12:45:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-11-20 12:45:35,171 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 13 [2022-11-20 12:45:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:35,172 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-11-20 12:45:35,172 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-20 12:45:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-11-20 12:45:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 12:45:35,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:35,174 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:35,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:45:35,174 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:35,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:35,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1082860028, now seen corresponding path program 1 times [2022-11-20 12:45:35,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:35,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870861908] [2022-11-20 12:45:35,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:35,193 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 12:45:35,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [770118801] [2022-11-20 12:45:35,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:35,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:45:35,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:45:35,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:45:35,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:45:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:45:35,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:45:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:45:35,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:45:35,451 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:45:35,452 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 12:45:35,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:45:35,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:45:35,662 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-20 12:45:35,666 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:45:35,687 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:45:35,692 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:45:35,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:45:35 BoogieIcfgContainer [2022-11-20 12:45:35,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:45:35,709 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:45:35,709 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:45:35,710 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:45:35,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:45:33" (3/4) ... [2022-11-20 12:45:35,717 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 12:45:35,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:45:35,718 INFO L158 Benchmark]: Toolchain (without parser) took 3378.34ms. Allocated memory was 136.3MB in the beginning and 195.0MB in the end (delta: 58.7MB). Free memory was 91.2MB in the beginning and 131.1MB in the end (delta: -39.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2022-11-20 12:45:35,720 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 107.0MB. Free memory was 47.9MB in the beginning and 47.7MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:45:35,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.80ms. Allocated memory is still 136.3MB. Free memory was 90.9MB in the beginning and 80.7MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 12:45:35,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.19ms. Allocated memory is still 136.3MB. Free memory was 80.7MB in the beginning and 79.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:45:35,729 INFO L158 Benchmark]: Boogie Preprocessor took 39.17ms. Allocated memory is still 136.3MB. Free memory was 79.2MB in the beginning and 78.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:45:35,729 INFO L158 Benchmark]: RCFGBuilder took 472.56ms. Allocated memory is still 136.3MB. Free memory was 78.0MB in the beginning and 67.2MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 12:45:35,730 INFO L158 Benchmark]: TraceAbstraction took 2420.15ms. Allocated memory was 136.3MB in the beginning and 195.0MB in the end (delta: 58.7MB). Free memory was 66.4MB in the beginning and 131.1MB in the end (delta: -64.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:45:35,730 INFO L158 Benchmark]: Witness Printer took 8.48ms. Allocated memory is still 195.0MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:45:35,733 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.33ms. Allocated memory is still 107.0MB. Free memory was 47.9MB in the beginning and 47.7MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.80ms. Allocated memory is still 136.3MB. Free memory was 90.9MB in the beginning and 80.7MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.19ms. Allocated memory is still 136.3MB. Free memory was 80.7MB in the beginning and 79.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.17ms. Allocated memory is still 136.3MB. Free memory was 79.2MB in the beginning and 78.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 472.56ms. Allocated memory is still 136.3MB. Free memory was 78.0MB in the beginning and 67.2MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2420.15ms. Allocated memory was 136.3MB in the beginning and 195.0MB in the end (delta: 58.7MB). Free memory was 66.4MB in the beginning and 131.1MB in the end (delta: -64.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 8.48ms. Allocated memory is still 195.0MB. Free memory is still 131.1MB. 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; [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=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, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 28 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 84 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2/2 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-20 12:45:35,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN --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-6b4ec56 [2022-11-20 12:45:38,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:45:38,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:45:38,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:45:38,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:45:38,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:45:38,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:45:38,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:45:38,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:45:38,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:45:38,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:45:38,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:45:38,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:45:38,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:45:38,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:45:38,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:45:38,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:45:38,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:45:38,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:45:38,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:45:38,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:45:38,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:45:38,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:45:38,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:45:38,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:45:38,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:45:38,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:45:38,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:45:38,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:45:38,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:45:38,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:45:38,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:45:38,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:45:38,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:45:38,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:45:38,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:45:38,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:45:38,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:45:38,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:45:38,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:45:38,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:45:38,745 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-20 12:45:38,798 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:45:38,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:45:38,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:45:38,801 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:45:38,802 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:45:38,802 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:45:38,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:45:38,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:45:38,803 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:45:38,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:45:38,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:45:38,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:45:38,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:45:38,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:45:38,806 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 12:45:38,806 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 12:45:38,806 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 12:45:38,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:45:38,807 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:45:38,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:45:38,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:45:38,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:45:38,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:45:38,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:45:38,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:45:38,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:45:38,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:45:38,809 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 12:45:38,809 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 12:45:38,809 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:45:38,810 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:45:38,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:45:38,810 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 12:45:38,810 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_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN 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-20 12:45:39,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:45:39,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:45:39,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:45:39,246 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:45:39,246 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:45:39,247 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2022-11-20 12:45:42,762 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:45:43,049 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:45:43,050 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2022-11-20 12:45:43,058 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/data/d6325ebd3/44bc362e438144bf858d27e8a2aac69f/FLAG1538d2cad [2022-11-20 12:45:43,079 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/data/d6325ebd3/44bc362e438144bf858d27e8a2aac69f [2022-11-20 12:45:43,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:45:43,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:45:43,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:45:43,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:45:43,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:45:43,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:45:43" (1/1) ... [2022-11-20 12:45:43,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@650da82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:43, skipping insertion in model container [2022-11-20 12:45:43,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:45:43" (1/1) ... [2022-11-20 12:45:43,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:45:43,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:45:43,282 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c[1292,1305] [2022-11-20 12:45:43,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:45:43,338 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:45:43,351 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c[1292,1305] [2022-11-20 12:45:43,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:45:43,381 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:45:43,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:43 WrapperNode [2022-11-20 12:45:43,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:45:43,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:45:43,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:45:43,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:45:43,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:43" (1/1) ... [2022-11-20 12:45:43,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:43" (1/1) ... [2022-11-20 12:45:43,422 INFO L138 Inliner]: procedures = 11, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2022-11-20 12:45:43,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:45:43,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:45:43,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:45:43,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:45:43,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:43" (1/1) ... [2022-11-20 12:45:43,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:43" (1/1) ... [2022-11-20 12:45:43,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:43" (1/1) ... [2022-11-20 12:45:43,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:43" (1/1) ... [2022-11-20 12:45:43,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:43" (1/1) ... [2022-11-20 12:45:43,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:43" (1/1) ... [2022-11-20 12:45:43,457 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:43" (1/1) ... [2022-11-20 12:45:43,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:43" (1/1) ... [2022-11-20 12:45:43,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:45:43,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:45:43,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:45:43,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:45:43,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:43" (1/1) ... [2022-11-20 12:45:43,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:45:43,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:45:43,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:45:43,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:45:43,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:45:43,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:45:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 12:45:43,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 12:45:43,658 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:45:43,661 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:45:43,897 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:45:43,921 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:45:43,921 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 12:45:43,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:45:43 BoogieIcfgContainer [2022-11-20 12:45:43,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:45:43,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:45:43,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:45:43,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:45:43,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:45:43" (1/3) ... [2022-11-20 12:45:43,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ad09fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:45:43, skipping insertion in model container [2022-11-20 12:45:43,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:43" (2/3) ... [2022-11-20 12:45:43,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ad09fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:45:43, skipping insertion in model container [2022-11-20 12:45:43,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:45:43" (3/3) ... [2022-11-20 12:45:43,933 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2022-11-20 12:45:43,963 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:45:43,963 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:45:44,042 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:45:44,059 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;@21c6751a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:45:44,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:45:44,064 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-20 12:45:44,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 12:45:44,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:44,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:44,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2022-11-20 12:45:44,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:45:44,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517706756] [2022-11-20 12:45:44,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:44,099 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-20 12:45:44,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:45:44,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:44,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:44,215 WARN L261 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 12:45:44,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:45:44,476 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-20 12:45:44,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:45:44,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:45:44,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517706756] [2022-11-20 12:45:44,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517706756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:44,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:44,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:45:44,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702840848] [2022-11-20 12:45:44,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:44,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:45:44,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:45:44,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:45:44,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:45:44,570 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-20 12:45:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:44,746 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2022-11-20 12:45:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:45:44,755 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-20 12:45:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:44,765 INFO L225 Difference]: With dead ends: 38 [2022-11-20 12:45:44,765 INFO L226 Difference]: Without dead ends: 23 [2022-11-20 12:45:44,769 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-20 12:45:44,774 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-20 12:45:44,775 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-20 12:45:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-20 12:45:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2022-11-20 12:45:44,832 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-20 12:45:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-11-20 12:45:44,837 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 7 [2022-11-20 12:45:44,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:44,838 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-11-20 12:45:44,838 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-20 12:45:44,839 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-11-20 12:45:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 12:45:44,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:44,840 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:44,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:45,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:45,054 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:45,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:45,055 INFO L85 PathProgramCache]: Analyzing trace with hash 679252028, now seen corresponding path program 1 times [2022-11-20 12:45:45,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:45:45,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113683469] [2022-11-20 12:45:45,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:45,058 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-20 12:45:45,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:45:45,059 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:45,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:45,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 12:45:45,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:45:45,225 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-20 12:45:45,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:45:45,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:45:45,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113683469] [2022-11-20 12:45:45,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113683469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:45,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:45,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:45:45,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894505339] [2022-11-20 12:45:45,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:45,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:45:45,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:45:45,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:45:45,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:45:45,231 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-20 12:45:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:45,340 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-11-20 12:45:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:45:45,341 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-20 12:45:45,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:45,342 INFO L225 Difference]: With dead ends: 31 [2022-11-20 12:45:45,342 INFO L226 Difference]: Without dead ends: 29 [2022-11-20 12:45:45,343 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-20 12:45:45,344 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.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:45,345 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.0s Time] [2022-11-20 12:45:45,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-20 12:45:45,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-11-20 12:45:45,354 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-20 12:45:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-11-20 12:45:45,356 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 13 [2022-11-20 12:45:45,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:45,356 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-11-20 12:45:45,357 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-20 12:45:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-11-20 12:45:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 12:45:45,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:45,358 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:45,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:45,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:45,572 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:45,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:45,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1082860028, now seen corresponding path program 1 times [2022-11-20 12:45:45,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:45:45,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484661825] [2022-11-20 12:45:45,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:45,574 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-20 12:45:45,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:45:45,579 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:45,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:45,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 12:45:45,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:45:45,822 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-20 12:45:45,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:45:45,957 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-20 12:45:45,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:45:45,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484661825] [2022-11-20 12:45:45,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484661825] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:45:45,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:45:45,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-11-20 12:45:45,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930279476] [2022-11-20 12:45:45,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:45:45,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:45:45,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:45:45,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:45:45,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:45:45,961 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-20 12:45:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:46,255 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-11-20 12:45:46,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:45:46,256 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-20 12:45:46,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:46,258 INFO L225 Difference]: With dead ends: 48 [2022-11-20 12:45:46,258 INFO L226 Difference]: Without dead ends: 46 [2022-11-20 12:45:46,259 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-20 12:45:46,260 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-20 12:45:46,261 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-20 12:45:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-20 12:45:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2022-11-20 12:45:46,276 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-20 12:45:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-11-20 12:45:46,278 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2022-11-20 12:45:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:46,279 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-11-20 12:45:46,279 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-20 12:45:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-11-20 12:45:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 12:45:46,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:46,281 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:46,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:46,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:46,494 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:46,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:46,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2028547162, now seen corresponding path program 2 times [2022-11-20 12:45:46,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:45:46,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023560679] [2022-11-20 12:45:46,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:45:46,496 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-20 12:45:46,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:45:46,497 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:46,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:46,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:45:46,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:45:46,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 12:45:46,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:45:46,811 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-20 12:45:46,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:45:46,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:45:46,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023560679] [2022-11-20 12:45:46,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023560679] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:45:46,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [593422203] [2022-11-20 12:45:46,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:45:46,939 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 12:45:46,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 [2022-11-20 12:45:46,947 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 12:45:46,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-20 12:45:47,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:45:47,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:45:47,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 12:45:47,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:45:47,232 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-20 12:45:47,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:45:47,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [593422203] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:45:47,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:45:47,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-11-20 12:45:47,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945228233] [2022-11-20 12:45:47,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:45:47,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:45:47,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:45:47,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:45:47,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:45:47,334 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-20 12:45:47,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:47,509 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-11-20 12:45:47,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:45:47,511 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-20 12:45:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:47,517 INFO L225 Difference]: With dead ends: 48 [2022-11-20 12:45:47,517 INFO L226 Difference]: Without dead ends: 46 [2022-11-20 12:45:47,519 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-20 12:45:47,524 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-20 12:45:47,527 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-20 12:45:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-20 12:45:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-20 12:45:47,558 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-20 12:45:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-11-20 12:45:47,570 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 26 [2022-11-20 12:45:47,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:47,571 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-11-20 12:45:47,571 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-20 12:45:47,572 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-11-20 12:45:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 12:45:47,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:47,579 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-20 12:45:47,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:47,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:45:47,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt [2022-11-20 12:45:47,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:47,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:47,994 INFO L85 PathProgramCache]: Analyzing trace with hash -690507524, now seen corresponding path program 3 times [2022-11-20 12:45:47,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:45:48,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872492114] [2022-11-20 12:45:48,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:45:48,004 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-20 12:45:48,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:45:48,010 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:48,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:48,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 12:45:48,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:45:48,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 12:45:48,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:45:48,340 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-20 12:45:48,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:45:48,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:45:48,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872492114] [2022-11-20 12:45:48,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872492114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:45:48,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1053328647] [2022-11-20 12:45:48,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:45:48,448 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 12:45:48,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 [2022-11-20 12:45:48,451 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 12:45:48,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-11-20 12:45:48,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 12:45:48,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:45:48,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 12:45:48,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:45:48,745 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-20 12:45:48,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:45:48,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1053328647] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:45:48,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:45:48,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-11-20 12:45:48,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237982651] [2022-11-20 12:45:48,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:45:48,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:45:48,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:45:48,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:45:48,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:45:48,802 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-20 12:45:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:48,889 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-11-20 12:45:48,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:45:48,889 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-20 12:45:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:48,891 INFO L225 Difference]: With dead ends: 52 [2022-11-20 12:45:48,891 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 12:45:48,892 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-20 12:45:48,893 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-20 12:45:48,893 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-20 12:45:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 12:45:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-20 12:45:48,917 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-20 12:45:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-11-20 12:45:48,919 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 39 [2022-11-20 12:45:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:48,920 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-11-20 12:45:48,920 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-20 12:45:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-11-20 12:45:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 12:45:48,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:48,926 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2022-11-20 12:45:48,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:49,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2022-11-20 12:45:49,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt [2022-11-20 12:45:49,340 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:49,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1442399130, now seen corresponding path program 4 times [2022-11-20 12:45:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:45:49,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762594715] [2022-11-20 12:45:49,341 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 12:45:49,341 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-20 12:45:49,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:45:49,343 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:49,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:49,428 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 12:45:49,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:45:49,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 12:45:49,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:45:49,966 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-20 12:45:49,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:45:50,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:45:50,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762594715] [2022-11-20 12:45:50,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762594715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:45:50,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1728781326] [2022-11-20 12:45:50,071 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 12:45:50,071 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 12:45:50,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 [2022-11-20 12:45:50,073 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 12:45:50,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-11-20 12:45:50,240 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 12:45:50,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:45:50,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 12:45:50,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:45:50,672 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-20 12:45:50,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:45:50,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1728781326] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:45:50,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:45:50,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-11-20 12:45:50,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9364378] [2022-11-20 12:45:50,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:45:50,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:45:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:45:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:45:50,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:45:50,719 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-20 12:45:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:50,817 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-11-20 12:45:50,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:45:50,818 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-20 12:45:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:50,819 INFO L225 Difference]: With dead ends: 56 [2022-11-20 12:45:50,820 INFO L226 Difference]: Without dead ends: 54 [2022-11-20 12:45:50,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:45:50,821 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-20 12:45:50,821 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-20 12:45:50,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-20 12:45:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-20 12:45:50,835 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-20 12:45:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-11-20 12:45:50,836 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 52 [2022-11-20 12:45:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:50,837 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-11-20 12:45:50,837 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-20 12:45:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-11-20 12:45:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 12:45:50,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:50,838 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2022-11-20 12:45:50,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-11-20 12:45:51,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:51,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:51,242 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:51,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:51,242 INFO L85 PathProgramCache]: Analyzing trace with hash -962754338, now seen corresponding path program 5 times [2022-11-20 12:45:51,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:45:51,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385327812] [2022-11-20 12:45:51,243 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 12:45:51,243 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-20 12:45:51,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:45:51,245 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:51,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:51,350 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-11-20 12:45:51,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:45:51,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 12:45:51,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:45:51,814 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-20 12:45:51,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:45:52,205 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-20 12:45:52,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:45:52,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385327812] [2022-11-20 12:45:52,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385327812] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:45:52,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:45:52,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-11-20 12:45:52,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000926633] [2022-11-20 12:45:52,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:45:52,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 12:45:52,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:45:52,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 12:45:52,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-11-20 12:45:52,208 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-20 12:45:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:53,195 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2022-11-20 12:45:53,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 12:45:53,199 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-20 12:45:53,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:53,200 INFO L225 Difference]: With dead ends: 89 [2022-11-20 12:45:53,200 INFO L226 Difference]: Without dead ends: 87 [2022-11-20 12:45:53,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-11-20 12:45:53,202 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-20 12:45:53,202 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-20 12:45:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-20 12:45:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2022-11-20 12:45:53,242 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-20 12:45:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2022-11-20 12:45:53,249 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 59 [2022-11-20 12:45:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:53,250 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2022-11-20 12:45:53,250 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-20 12:45:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2022-11-20 12:45:53,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-20 12:45:53,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:53,260 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2022-11-20 12:45:53,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:53,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:53,474 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:53,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1753079548, now seen corresponding path program 6 times [2022-11-20 12:45:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:45:53,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641819881] [2022-11-20 12:45:53,476 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 12:45:53,476 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-20 12:45:53,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:45:53,477 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:53,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:45:53,698 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-11-20 12:45:53,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:45:53,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-20 12:45:53,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:45:54,928 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-20 12:45:54,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:45:56,406 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-20 12:45:56,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:45:56,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641819881] [2022-11-20 12:45:56,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641819881] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:45:56,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:45:56,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-11-20 12:45:56,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685077579] [2022-11-20 12:45:56,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:45:56,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 12:45:56,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:45:56,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 12:45:56,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2022-11-20 12:45:56,410 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-20 12:46:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:46:00,588 INFO L93 Difference]: Finished difference Result 148 states and 181 transitions. [2022-11-20 12:46:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 12:46:00,589 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-20 12:46:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:46:00,591 INFO L225 Difference]: With dead ends: 148 [2022-11-20 12:46:00,591 INFO L226 Difference]: Without dead ends: 146 [2022-11-20 12:46:00,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=523, Invalid=1927, Unknown=0, NotChecked=0, Total=2450 [2022-11-20 12:46:00,593 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 84 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:46:00,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 353 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-20 12:46:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-20 12:46:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2022-11-20 12:46:00,647 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-20 12:46:00,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2022-11-20 12:46:00,649 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 124 [2022-11-20 12:46:00,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:46:00,650 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2022-11-20 12:46:00,650 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-20 12:46:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-11-20 12:46:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-20 12:46:00,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:46:00,653 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1] [2022-11-20 12:46:00,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:46:00,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:46:00,866 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:46:00,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:46:00,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1810513054, now seen corresponding path program 7 times [2022-11-20 12:46:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:46:00,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124372206] [2022-11-20 12:46:00,867 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 12:46:00,868 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-20 12:46:00,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:46:00,869 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:46:00,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:46:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:46:01,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:46:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:46:01,419 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 12:46:01,419 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:46:01,421 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 12:46:01,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:46:01,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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-20 12:46:01,643 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2022-11-20 12:46:01,648 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:46:01,770 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,787 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,787 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,787 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,787 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,788 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,788 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,788 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,788 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,788 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,788 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,789 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,789 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,789 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,789 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:46:01 BoogieIcfgContainer [2022-11-20 12:46:01,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:46:01,842 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:46:01,842 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:46:01,842 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:46:01,843 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:45:43" (3/4) ... [2022-11-20 12:46:01,845 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 12:46:01,904 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,918 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,919 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,919 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,919 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,919 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,919 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,919 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,920 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,920 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,920 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,920 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,920 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,920 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:01,920 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 12:46:02,031 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:46:02,031 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:46:02,032 INFO L158 Benchmark]: Toolchain (without parser) took 18947.60ms. Allocated memory was 75.5MB in the beginning and 176.2MB in the end (delta: 100.7MB). Free memory was 50.2MB in the beginning and 139.8MB in the end (delta: -89.6MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB. [2022-11-20 12:46:02,032 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 75.5MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:46:02,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.19ms. Allocated memory is still 75.5MB. Free memory was 50.0MB in the beginning and 39.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 12:46:02,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.96ms. Allocated memory is still 75.5MB. Free memory was 39.3MB in the beginning and 37.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:46:02,033 INFO L158 Benchmark]: Boogie Preprocessor took 37.09ms. Allocated memory is still 75.5MB. Free memory was 37.8MB in the beginning and 36.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:46:02,034 INFO L158 Benchmark]: RCFGBuilder took 461.76ms. Allocated memory is still 75.5MB. Free memory was 36.5MB in the beginning and 47.1MB in the end (delta: -10.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 12:46:02,034 INFO L158 Benchmark]: TraceAbstraction took 17915.17ms. Allocated memory was 75.5MB in the beginning and 176.2MB in the end (delta: 100.7MB). Free memory was 46.6MB in the beginning and 54.1MB in the end (delta: -7.6MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2022-11-20 12:46:02,035 INFO L158 Benchmark]: Witness Printer took 189.89ms. Allocated memory is still 176.2MB. Free memory was 54.1MB in the beginning and 139.8MB in the end (delta: -85.6MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-11-20 12:46:02,037 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.24ms. Allocated memory is still 75.5MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.19ms. Allocated memory is still 75.5MB. Free memory was 50.0MB in the beginning and 39.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.96ms. Allocated memory is still 75.5MB. Free memory was 39.3MB in the beginning and 37.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.09ms. Allocated memory is still 75.5MB. Free memory was 37.8MB in the beginning and 36.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 461.76ms. Allocated memory is still 75.5MB. Free memory was 36.5MB in the beginning and 47.1MB in the end (delta: -10.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17915.17ms. Allocated memory was 75.5MB in the beginning and 176.2MB in the end (delta: 100.7MB). Free memory was 46.6MB in the beginning and 54.1MB in the end (delta: -7.6MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. * Witness Printer took 189.89ms. Allocated memory is still 176.2MB. Free memory was 54.1MB in the beginning and 139.8MB in the end (delta: -85.6MB). Peak memory consumption was 6.6MB. 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: 17.6s, OverallIterations: 9, TraceHistogramMax: 29, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 988 SdHoareTripleChecker+Invalid, 2.6s 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.7s 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.6s 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-20 12:46:02,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6af4950b-a55f-470e-815b-2cfeceae8752/bin/uautomizer-ug76WZFUDN/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