./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label31.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label31.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R --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 32bit --witnessprinter.graph.data.programhash bfc66911488db0449024c8298d45a8f19a48d6acc429700f07d0b84fc6ce385a --- 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-38b53e6 [2022-11-25 18:28:50,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:28:50,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:28:50,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:28:50,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:28:50,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:28:50,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:28:50,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:28:50,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:28:50,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:28:50,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:28:50,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:28:50,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:28:50,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:28:50,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:28:50,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:28:50,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:28:50,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:28:50,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:28:50,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:28:50,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:28:50,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:28:50,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:28:50,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:28:50,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:28:50,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:28:50,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:28:50,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:28:50,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:28:50,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:28:50,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:28:50,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:28:50,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:28:50,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:28:50,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:28:50,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:28:50,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:28:50,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:28:50,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:28:50,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:28:50,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:28:50,777 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:28:50,821 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:28:50,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:28:50,823 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:28:50,823 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:28:50,824 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:28:50,824 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:28:50,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:28:50,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:28:50,826 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:28:50,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:28:50,828 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:28:50,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:28:50,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:28:50,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:28:50,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:28:50,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:28:50,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:28:50,830 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:28:50,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:28:50,830 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:28:50,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:28:50,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:28:50,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:28:50,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:28:50,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:28:50,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:28:50,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:28:50,832 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:28:50,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:28:50,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:28:50,833 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:28:50,833 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:28:50,834 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:28:50,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:28:50,834 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/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_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfc66911488db0449024c8298d45a8f19a48d6acc429700f07d0b84fc6ce385a [2022-11-25 18:28:51,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:28:51,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:28:51,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:28:51,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:28:51,244 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:28:51,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/eca-rers2012/Problem11_label31.c [2022-11-25 18:28:54,440 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:28:54,886 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:28:54,886 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/sv-benchmarks/c/eca-rers2012/Problem11_label31.c [2022-11-25 18:28:54,904 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/data/88f7fca5f/67ad68202f124c27a87d897447b6d77c/FLAG685665c4a [2022-11-25 18:28:54,926 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/data/88f7fca5f/67ad68202f124c27a87d897447b6d77c [2022-11-25 18:28:54,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:28:54,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:28:54,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:28:54,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:28:54,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:28:54,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:28:54" (1/1) ... [2022-11-25 18:28:54,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2135bf8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:54, skipping insertion in model container [2022-11-25 18:28:54,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:28:54" (1/1) ... [2022-11-25 18:28:54,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:28:55,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:28:55,213 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_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/sv-benchmarks/c/eca-rers2012/Problem11_label31.c[1180,1193] [2022-11-25 18:28:55,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:28:55,600 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:28:55,615 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_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/sv-benchmarks/c/eca-rers2012/Problem11_label31.c[1180,1193] [2022-11-25 18:28:55,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:28:55,760 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:28:55,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:55 WrapperNode [2022-11-25 18:28:55,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:28:55,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:28:55,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:28:55,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:28:55,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:55" (1/1) ... [2022-11-25 18:28:55,799 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:55" (1/1) ... [2022-11-25 18:28:55,966 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2022-11-25 18:28:55,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:28:55,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:28:55,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:28:55,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:28:55,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:55" (1/1) ... [2022-11-25 18:28:55,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:55" (1/1) ... [2022-11-25 18:28:55,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:55" (1/1) ... [2022-11-25 18:28:55,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:55" (1/1) ... [2022-11-25 18:28:56,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:55" (1/1) ... [2022-11-25 18:28:56,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:55" (1/1) ... [2022-11-25 18:28:56,099 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:55" (1/1) ... [2022-11-25 18:28:56,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:55" (1/1) ... [2022-11-25 18:28:56,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:28:56,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:28:56,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:28:56,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:28:56,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:55" (1/1) ... [2022-11-25 18:28:56,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:28:56,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:28:56,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:28:56,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:28:56,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:28:56,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:28:56,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:28:56,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:28:56,292 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:28:56,295 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:28:58,306 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:28:58,329 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:28:58,339 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 18:28:58,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:28:58 BoogieIcfgContainer [2022-11-25 18:28:58,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:28:58,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:28:58,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:28:58,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:28:58,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:28:54" (1/3) ... [2022-11-25 18:28:58,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12385e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:28:58, skipping insertion in model container [2022-11-25 18:28:58,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:55" (2/3) ... [2022-11-25 18:28:58,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12385e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:28:58, skipping insertion in model container [2022-11-25 18:28:58,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:28:58" (3/3) ... [2022-11-25 18:28:58,357 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label31.c [2022-11-25 18:28:58,380 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:28:58,380 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:28:58,445 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:28:58,453 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;@17822a8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:28:58,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:28:58,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 18:28:58,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:28:58,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:58,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:28:58,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:58,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1810726993, now seen corresponding path program 1 times [2022-11-25 18:28:58,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:58,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630143360] [2022-11-25 18:28:58,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:58,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:58,720 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-25 18:28:58,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:58,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630143360] [2022-11-25 18:28:58,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630143360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:58,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:58,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:28:58,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164024585] [2022-11-25 18:28:58,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:58,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:28:58,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:58,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:28:58,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:28:58,781 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:00,362 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2022-11-25 18:29:00,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:29:00,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 18:29:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:00,382 INFO L225 Difference]: With dead ends: 776 [2022-11-25 18:29:00,382 INFO L226 Difference]: Without dead ends: 413 [2022-11-25 18:29:00,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:00,391 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 220 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:00,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 18:29:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-25 18:29:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2022-11-25 18:29:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2022-11-25 18:29:00,461 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 7 [2022-11-25 18:29:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:00,462 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2022-11-25 18:29:00,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2022-11-25 18:29:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-25 18:29:00,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:00,465 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:00,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:29:00,466 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:00,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash 31514424, now seen corresponding path program 1 times [2022-11-25 18:29:00,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:00,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672301580] [2022-11-25 18:29:00,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:00,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:00,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:00,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672301580] [2022-11-25 18:29:00,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672301580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:00,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:00,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:29:00,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96303634] [2022-11-25 18:29:00,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:00,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:29:00,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:00,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:29:00,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:00,880 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:02,064 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2022-11-25 18:29:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:29:02,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-11-25 18:29:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:02,073 INFO L225 Difference]: With dead ends: 1209 [2022-11-25 18:29:02,073 INFO L226 Difference]: Without dead ends: 800 [2022-11-25 18:29:02,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:02,076 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:02,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 122 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 18:29:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-11-25 18:29:02,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2022-11-25 18:29:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3842239185750635) internal successors, (1088), 786 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2022-11-25 18:29:02,145 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 75 [2022-11-25 18:29:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:02,146 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2022-11-25 18:29:02,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2022-11-25 18:29:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-25 18:29:02,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:02,149 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:02,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:29:02,150 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:02,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:02,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2109627523, now seen corresponding path program 1 times [2022-11-25 18:29:02,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:02,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280331441] [2022-11-25 18:29:02,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:02,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:02,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280331441] [2022-11-25 18:29:02,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280331441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:02,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:02,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:29:02,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247567835] [2022-11-25 18:29:02,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:02,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:29:02,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:02,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:29:02,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:02,566 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:03,673 INFO L93 Difference]: Finished difference Result 1942 states and 2629 transitions. [2022-11-25 18:29:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:29:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-11-25 18:29:03,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:03,679 INFO L225 Difference]: With dead ends: 1942 [2022-11-25 18:29:03,679 INFO L226 Difference]: Without dead ends: 1157 [2022-11-25 18:29:03,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:03,681 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:03,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 18:29:03,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-11-25 18:29:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2022-11-25 18:29:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277056277056277) internal successors, (1475), 1155 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2022-11-25 18:29:03,716 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 77 [2022-11-25 18:29:03,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:03,716 INFO L495 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2022-11-25 18:29:03,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2022-11-25 18:29:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-25 18:29:03,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:03,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:03,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:29:03,721 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:03,721 INFO L85 PathProgramCache]: Analyzing trace with hash -938559116, now seen corresponding path program 1 times [2022-11-25 18:29:03,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:03,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160570889] [2022-11-25 18:29:03,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:03,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:04,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160570889] [2022-11-25 18:29:04,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160570889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:04,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:04,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:29:04,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57387709] [2022-11-25 18:29:04,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:04,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:29:04,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:04,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:29:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:04,032 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:05,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:05,172 INFO L93 Difference]: Finished difference Result 2691 states and 3513 transitions. [2022-11-25 18:29:05,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:29:05,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-11-25 18:29:05,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:05,182 INFO L225 Difference]: With dead ends: 2691 [2022-11-25 18:29:05,182 INFO L226 Difference]: Without dead ends: 1721 [2022-11-25 18:29:05,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:05,185 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 199 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:05,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 336 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 18:29:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2022-11-25 18:29:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1528. [2022-11-25 18:29:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1527 states have (on average 1.260641781270465) internal successors, (1925), 1527 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1925 transitions. [2022-11-25 18:29:05,222 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1925 transitions. Word has length 119 [2022-11-25 18:29:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:05,223 INFO L495 AbstractCegarLoop]: Abstraction has 1528 states and 1925 transitions. [2022-11-25 18:29:05,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1925 transitions. [2022-11-25 18:29:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-25 18:29:05,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:05,228 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:05,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:29:05,229 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1014653344, now seen corresponding path program 1 times [2022-11-25 18:29:05,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:05,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922017536] [2022-11-25 18:29:05,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:05,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:06,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:06,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922017536] [2022-11-25 18:29:06,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922017536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:06,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:06,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:29:06,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489640134] [2022-11-25 18:29:06,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:06,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:06,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:06,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:06,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:06,027 INFO L87 Difference]: Start difference. First operand 1528 states and 1925 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:07,690 INFO L93 Difference]: Finished difference Result 4165 states and 5468 transitions. [2022-11-25 18:29:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:29:07,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2022-11-25 18:29:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:07,700 INFO L225 Difference]: With dead ends: 4165 [2022-11-25 18:29:07,701 INFO L226 Difference]: Without dead ends: 2639 [2022-11-25 18:29:07,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:07,704 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 327 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:07,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 159 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-25 18:29:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2022-11-25 18:29:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2639. [2022-11-25 18:29:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 2638 states have (on average 1.2130401819560273) internal successors, (3200), 2638 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 3200 transitions. [2022-11-25 18:29:07,767 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 3200 transitions. Word has length 189 [2022-11-25 18:29:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:07,768 INFO L495 AbstractCegarLoop]: Abstraction has 2639 states and 3200 transitions. [2022-11-25 18:29:07,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 3200 transitions. [2022-11-25 18:29:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-11-25 18:29:07,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:07,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:07,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:29:07,773 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:07,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:07,774 INFO L85 PathProgramCache]: Analyzing trace with hash 429301753, now seen corresponding path program 1 times [2022-11-25 18:29:07,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:07,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972206829] [2022-11-25 18:29:07,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:07,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:08,159 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-11-25 18:29:08,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:08,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972206829] [2022-11-25 18:29:08,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972206829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:08,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:08,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:29:08,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083531183] [2022-11-25 18:29:08,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:08,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:29:08,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:08,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:29:08,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:08,163 INFO L87 Difference]: Start difference. First operand 2639 states and 3200 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:09,283 INFO L93 Difference]: Finished difference Result 6019 states and 7424 transitions. [2022-11-25 18:29:09,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:29:09,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2022-11-25 18:29:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:09,295 INFO L225 Difference]: With dead ends: 6019 [2022-11-25 18:29:09,295 INFO L226 Difference]: Without dead ends: 3382 [2022-11-25 18:29:09,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:09,301 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 194 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:09,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 377 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 18:29:09,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3382 states. [2022-11-25 18:29:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3382 to 3194. [2022-11-25 18:29:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3194 states, 3193 states have (on average 1.19699342311306) internal successors, (3822), 3193 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 3822 transitions. [2022-11-25 18:29:09,380 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 3822 transitions. Word has length 199 [2022-11-25 18:29:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:09,382 INFO L495 AbstractCegarLoop]: Abstraction has 3194 states and 3822 transitions. [2022-11-25 18:29:09,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 3822 transitions. [2022-11-25 18:29:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-11-25 18:29:09,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:09,386 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:09,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:29:09,387 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:09,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:09,387 INFO L85 PathProgramCache]: Analyzing trace with hash -64484103, now seen corresponding path program 1 times [2022-11-25 18:29:09,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:09,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491205541] [2022-11-25 18:29:09,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:10,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:10,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491205541] [2022-11-25 18:29:10,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491205541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:10,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:10,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:29:10,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058938225] [2022-11-25 18:29:10,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:10,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:10,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:10,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:10,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:10,018 INFO L87 Difference]: Start difference. First operand 3194 states and 3822 transitions. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:11,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:11,336 INFO L93 Difference]: Finished difference Result 6938 states and 8296 transitions. [2022-11-25 18:29:11,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:29:11,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2022-11-25 18:29:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:11,351 INFO L225 Difference]: With dead ends: 6938 [2022-11-25 18:29:11,351 INFO L226 Difference]: Without dead ends: 3746 [2022-11-25 18:29:11,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:11,356 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 313 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:11,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 165 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-25 18:29:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2022-11-25 18:29:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3562. [2022-11-25 18:29:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3562 states, 3561 states have (on average 1.191800056163999) internal successors, (4244), 3561 states have internal predecessors, (4244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3562 states to 3562 states and 4244 transitions. [2022-11-25 18:29:11,477 INFO L78 Accepts]: Start accepts. Automaton has 3562 states and 4244 transitions. Word has length 199 [2022-11-25 18:29:11,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:11,479 INFO L495 AbstractCegarLoop]: Abstraction has 3562 states and 4244 transitions. [2022-11-25 18:29:11,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states and 4244 transitions. [2022-11-25 18:29:11,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-11-25 18:29:11,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:11,484 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:11,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:29:11,485 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1714515319, now seen corresponding path program 1 times [2022-11-25 18:29:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:11,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938995253] [2022-11-25 18:29:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:11,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:12,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:12,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938995253] [2022-11-25 18:29:12,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938995253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:12,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:12,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:29:12,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5974720] [2022-11-25 18:29:12,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:12,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:12,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:12,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:12,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:12,223 INFO L87 Difference]: Start difference. First operand 3562 states and 4244 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:14,185 INFO L93 Difference]: Finished difference Result 9899 states and 12006 transitions. [2022-11-25 18:29:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:29:14,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2022-11-25 18:29:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:14,206 INFO L225 Difference]: With dead ends: 9899 [2022-11-25 18:29:14,207 INFO L226 Difference]: Without dead ends: 6339 [2022-11-25 18:29:14,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:14,212 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 246 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:14,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 74 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-25 18:29:14,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6339 states. [2022-11-25 18:29:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6339 to 6148. [2022-11-25 18:29:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6148 states, 6147 states have (on average 1.1874084919472914) internal successors, (7299), 6147 states have internal predecessors, (7299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 7299 transitions. [2022-11-25 18:29:14,342 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 7299 transitions. Word has length 204 [2022-11-25 18:29:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:14,343 INFO L495 AbstractCegarLoop]: Abstraction has 6148 states and 7299 transitions. [2022-11-25 18:29:14,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 7299 transitions. [2022-11-25 18:29:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-11-25 18:29:14,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:14,348 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:14,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:29:14,348 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:14,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:14,349 INFO L85 PathProgramCache]: Analyzing trace with hash 779328278, now seen corresponding path program 1 times [2022-11-25 18:29:14,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:14,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913815786] [2022-11-25 18:29:14,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:14,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 18:29:14,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:14,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913815786] [2022-11-25 18:29:14,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913815786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:14,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:14,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:29:14,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385659963] [2022-11-25 18:29:14,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:14,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:29:14,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:14,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:29:14,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:14,561 INFO L87 Difference]: Start difference. First operand 6148 states and 7299 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:15,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:15,602 INFO L93 Difference]: Finished difference Result 13761 states and 16670 transitions. [2022-11-25 18:29:15,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:29:15,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2022-11-25 18:29:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:15,658 INFO L225 Difference]: With dead ends: 13761 [2022-11-25 18:29:15,658 INFO L226 Difference]: Without dead ends: 7983 [2022-11-25 18:29:15,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:15,667 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:15,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 154 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 18:29:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7983 states. [2022-11-25 18:29:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7983 to 7613. [2022-11-25 18:29:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7613 states, 7612 states have (on average 1.1730162900683132) internal successors, (8929), 7612 states have internal predecessors, (8929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7613 states to 7613 states and 8929 transitions. [2022-11-25 18:29:15,856 INFO L78 Accepts]: Start accepts. Automaton has 7613 states and 8929 transitions. Word has length 210 [2022-11-25 18:29:15,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:15,857 INFO L495 AbstractCegarLoop]: Abstraction has 7613 states and 8929 transitions. [2022-11-25 18:29:15,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 7613 states and 8929 transitions. [2022-11-25 18:29:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-11-25 18:29:15,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:15,862 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:15,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:29:15,862 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:15,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:15,863 INFO L85 PathProgramCache]: Analyzing trace with hash -293367705, now seen corresponding path program 1 times [2022-11-25 18:29:15,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:15,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735156867] [2022-11-25 18:29:15,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:15,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:16,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:16,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735156867] [2022-11-25 18:29:16,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735156867] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:29:16,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879927593] [2022-11-25 18:29:16,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:16,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:29:16,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:29:16,638 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:29:16,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:29:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:16,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:29:16,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:29:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:17,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:29:17,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879927593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:17,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:29:17,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-25 18:29:17,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388397248] [2022-11-25 18:29:17,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:17,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:17,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:17,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:17,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:29:17,520 INFO L87 Difference]: Start difference. First operand 7613 states and 8929 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:19,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:19,099 INFO L93 Difference]: Finished difference Result 15596 states and 18277 transitions. [2022-11-25 18:29:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:29:19,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2022-11-25 18:29:19,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:19,118 INFO L225 Difference]: With dead ends: 15596 [2022-11-25 18:29:19,118 INFO L226 Difference]: Without dead ends: 8353 [2022-11-25 18:29:19,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:29:19,126 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 192 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:19,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 186 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 18:29:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8353 states. [2022-11-25 18:29:19,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8353 to 8165. [2022-11-25 18:29:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8165 states, 8164 states have (on average 1.1657275845173933) internal successors, (9517), 8164 states have internal predecessors, (9517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8165 states to 8165 states and 9517 transitions. [2022-11-25 18:29:19,330 INFO L78 Accepts]: Start accepts. Automaton has 8165 states and 9517 transitions. Word has length 220 [2022-11-25 18:29:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:19,330 INFO L495 AbstractCegarLoop]: Abstraction has 8165 states and 9517 transitions. [2022-11-25 18:29:19,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 8165 states and 9517 transitions. [2022-11-25 18:29:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-11-25 18:29:19,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:19,336 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:19,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:29:19,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 18:29:19,544 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:19,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2037569154, now seen corresponding path program 1 times [2022-11-25 18:29:19,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:19,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463164094] [2022-11-25 18:29:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-25 18:29:19,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:19,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463164094] [2022-11-25 18:29:19,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463164094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:19,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:19,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:29:19,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568955469] [2022-11-25 18:29:19,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:19,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:29:19,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:19,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:29:19,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:19,821 INFO L87 Difference]: Start difference. First operand 8165 states and 9517 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:21,012 INFO L93 Difference]: Finished difference Result 17437 states and 20571 transitions. [2022-11-25 18:29:21,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:29:21,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2022-11-25 18:29:21,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:21,032 INFO L225 Difference]: With dead ends: 17437 [2022-11-25 18:29:21,032 INFO L226 Difference]: Without dead ends: 9458 [2022-11-25 18:29:21,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:21,041 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 194 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:21,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 378 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 18:29:21,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9458 states. [2022-11-25 18:29:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9458 to 9452. [2022-11-25 18:29:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9452 states, 9451 states have (on average 1.15829012802878) internal successors, (10947), 9451 states have internal predecessors, (10947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 10947 transitions. [2022-11-25 18:29:21,247 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 10947 transitions. Word has length 226 [2022-11-25 18:29:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:21,248 INFO L495 AbstractCegarLoop]: Abstraction has 9452 states and 10947 transitions. [2022-11-25 18:29:21,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 10947 transitions. [2022-11-25 18:29:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-11-25 18:29:21,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:21,255 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:21,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:29:21,255 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:21,256 INFO L85 PathProgramCache]: Analyzing trace with hash 613229861, now seen corresponding path program 1 times [2022-11-25 18:29:21,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:21,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846025787] [2022-11-25 18:29:21,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:21,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-11-25 18:29:22,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:22,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846025787] [2022-11-25 18:29:22,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846025787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:22,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:22,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:29:22,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646242322] [2022-11-25 18:29:22,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:22,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:29:22,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:22,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:29:22,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:29:22,072 INFO L87 Difference]: Start difference. First operand 9452 states and 10947 transitions. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:23,431 INFO L93 Difference]: Finished difference Result 20413 states and 23615 transitions. [2022-11-25 18:29:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:29:23,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2022-11-25 18:29:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:23,455 INFO L225 Difference]: With dead ends: 20413 [2022-11-25 18:29:23,455 INFO L226 Difference]: Without dead ends: 11290 [2022-11-25 18:29:23,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:29:23,465 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 142 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:23,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 162 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-25 18:29:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11290 states. [2022-11-25 18:29:23,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11290 to 9449. [2022-11-25 18:29:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9449 states, 9448 states have (on average 1.1566469093988145) internal successors, (10928), 9448 states have internal predecessors, (10928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9449 states to 9449 states and 10928 transitions. [2022-11-25 18:29:23,729 INFO L78 Accepts]: Start accepts. Automaton has 9449 states and 10928 transitions. Word has length 269 [2022-11-25 18:29:23,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:23,730 INFO L495 AbstractCegarLoop]: Abstraction has 9449 states and 10928 transitions. [2022-11-25 18:29:23,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:23,730 INFO L276 IsEmpty]: Start isEmpty. Operand 9449 states and 10928 transitions. [2022-11-25 18:29:23,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-11-25 18:29:23,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:23,739 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:23,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:29:23,739 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:23,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash -794970071, now seen corresponding path program 1 times [2022-11-25 18:29:23,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:23,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739547379] [2022-11-25 18:29:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:23,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 18:29:24,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:24,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739547379] [2022-11-25 18:29:24,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739547379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:24,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:24,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:29:24,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409714006] [2022-11-25 18:29:24,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:24,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:24,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:24,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:24,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:24,363 INFO L87 Difference]: Start difference. First operand 9449 states and 10928 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:25,718 INFO L93 Difference]: Finished difference Result 18903 states and 21867 transitions. [2022-11-25 18:29:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:29:25,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2022-11-25 18:29:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:25,737 INFO L225 Difference]: With dead ends: 18903 [2022-11-25 18:29:25,737 INFO L226 Difference]: Without dead ends: 9824 [2022-11-25 18:29:25,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:25,746 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 218 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:25,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 180 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-25 18:29:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9824 states. [2022-11-25 18:29:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9824 to 9449. [2022-11-25 18:29:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9449 states, 9448 states have (on average 1.155376799322608) internal successors, (10916), 9448 states have internal predecessors, (10916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9449 states to 9449 states and 10916 transitions. [2022-11-25 18:29:25,893 INFO L78 Accepts]: Start accepts. Automaton has 9449 states and 10916 transitions. Word has length 274 [2022-11-25 18:29:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:25,893 INFO L495 AbstractCegarLoop]: Abstraction has 9449 states and 10916 transitions. [2022-11-25 18:29:25,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 9449 states and 10916 transitions. [2022-11-25 18:29:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-11-25 18:29:25,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:25,901 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:25,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:29:25,901 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:25,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:25,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1208608957, now seen corresponding path program 1 times [2022-11-25 18:29:25,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:25,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965136075] [2022-11-25 18:29:25,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:25,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:26,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:26,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965136075] [2022-11-25 18:29:26,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965136075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:26,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:26,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:29:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344589310] [2022-11-25 18:29:26,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:26,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:26,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:26,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:26,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:26,865 INFO L87 Difference]: Start difference. First operand 9449 states and 10916 transitions. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:28,537 INFO L93 Difference]: Finished difference Result 21114 states and 24724 transitions. [2022-11-25 18:29:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:29:28,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2022-11-25 18:29:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:28,561 INFO L225 Difference]: With dead ends: 21114 [2022-11-25 18:29:28,561 INFO L226 Difference]: Without dead ends: 12035 [2022-11-25 18:29:28,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:28,569 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 274 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:28,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 121 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-25 18:29:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12035 states. [2022-11-25 18:29:28,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12035 to 11657. [2022-11-25 18:29:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11657 states, 11656 states have (on average 1.1690974605353466) internal successors, (13627), 11656 states have internal predecessors, (13627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11657 states to 11657 states and 13627 transitions. [2022-11-25 18:29:28,733 INFO L78 Accepts]: Start accepts. Automaton has 11657 states and 13627 transitions. Word has length 281 [2022-11-25 18:29:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:28,734 INFO L495 AbstractCegarLoop]: Abstraction has 11657 states and 13627 transitions. [2022-11-25 18:29:28,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 11657 states and 13627 transitions. [2022-11-25 18:29:28,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-11-25 18:29:28,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:28,741 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:28,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:29:28,742 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:28,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash 76681881, now seen corresponding path program 1 times [2022-11-25 18:29:28,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:28,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945978089] [2022-11-25 18:29:28,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:28,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:29,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:29,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945978089] [2022-11-25 18:29:29,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945978089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:29,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:29,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:29:29,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991226621] [2022-11-25 18:29:29,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:29,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:29,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:29,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:29,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:29,071 INFO L87 Difference]: Start difference. First operand 11657 states and 13627 transitions. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:30,777 INFO L93 Difference]: Finished difference Result 31612 states and 36816 transitions. [2022-11-25 18:29:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:29:30,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2022-11-25 18:29:30,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:30,819 INFO L225 Difference]: With dead ends: 31612 [2022-11-25 18:29:30,819 INFO L226 Difference]: Without dead ends: 20325 [2022-11-25 18:29:30,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:30,832 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 227 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:30,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 73 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 18:29:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20325 states. [2022-11-25 18:29:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20325 to 20323. [2022-11-25 18:29:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20323 states, 20322 states have (on average 1.1461962405275072) internal successors, (23293), 20322 states have internal predecessors, (23293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20323 states to 20323 states and 23293 transitions. [2022-11-25 18:29:31,141 INFO L78 Accepts]: Start accepts. Automaton has 20323 states and 23293 transitions. Word has length 281 [2022-11-25 18:29:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:31,141 INFO L495 AbstractCegarLoop]: Abstraction has 20323 states and 23293 transitions. [2022-11-25 18:29:31,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 20323 states and 23293 transitions. [2022-11-25 18:29:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2022-11-25 18:29:31,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:31,147 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:31,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:29:31,148 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:31,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:31,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1472490016, now seen corresponding path program 1 times [2022-11-25 18:29:31,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:31,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102465297] [2022-11-25 18:29:31,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:31,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:31,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:31,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102465297] [2022-11-25 18:29:31,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102465297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:31,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:31,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:29:31,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422792271] [2022-11-25 18:29:31,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:31,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:31,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:31,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:31,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:31,967 INFO L87 Difference]: Start difference. First operand 20323 states and 23293 transitions. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:33,650 INFO L93 Difference]: Finished difference Result 42118 states and 48192 transitions. [2022-11-25 18:29:33,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:29:33,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 289 [2022-11-25 18:29:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:33,684 INFO L225 Difference]: With dead ends: 42118 [2022-11-25 18:29:33,684 INFO L226 Difference]: Without dead ends: 21796 [2022-11-25 18:29:33,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:33,697 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 152 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:33,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 109 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 18:29:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21796 states. [2022-11-25 18:29:34,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21796 to 21794. [2022-11-25 18:29:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21794 states, 21793 states have (on average 1.1383012894048548) internal successors, (24807), 21793 states have internal predecessors, (24807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21794 states to 21794 states and 24807 transitions. [2022-11-25 18:29:34,101 INFO L78 Accepts]: Start accepts. Automaton has 21794 states and 24807 transitions. Word has length 289 [2022-11-25 18:29:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:34,101 INFO L495 AbstractCegarLoop]: Abstraction has 21794 states and 24807 transitions. [2022-11-25 18:29:34,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 21794 states and 24807 transitions. [2022-11-25 18:29:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2022-11-25 18:29:34,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:34,107 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:34,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:29:34,107 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1037856709, now seen corresponding path program 1 times [2022-11-25 18:29:34,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:34,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227758394] [2022-11-25 18:29:34,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:34,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-25 18:29:34,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:34,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227758394] [2022-11-25 18:29:34,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227758394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:34,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:34,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:29:34,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982516005] [2022-11-25 18:29:34,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:34,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:29:34,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:34,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:29:34,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:29:34,821 INFO L87 Difference]: Start difference. First operand 21794 states and 24807 transitions. Second operand has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:35,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:35,745 INFO L93 Difference]: Finished difference Result 40206 states and 45903 transitions. [2022-11-25 18:29:35,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:29:35,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 291 [2022-11-25 18:29:35,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:35,773 INFO L225 Difference]: With dead ends: 40206 [2022-11-25 18:29:35,773 INFO L226 Difference]: Without dead ends: 21418 [2022-11-25 18:29:35,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:29:35,787 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 219 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:35,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 68 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 18:29:35,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21418 states. [2022-11-25 18:29:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21418 to 21415. [2022-11-25 18:29:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21415 states, 21414 states have (on average 1.1346782478752218) internal successors, (24298), 21414 states have internal predecessors, (24298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21415 states to 21415 states and 24298 transitions. [2022-11-25 18:29:36,088 INFO L78 Accepts]: Start accepts. Automaton has 21415 states and 24298 transitions. Word has length 291 [2022-11-25 18:29:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:36,088 INFO L495 AbstractCegarLoop]: Abstraction has 21415 states and 24298 transitions. [2022-11-25 18:29:36,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 21415 states and 24298 transitions. [2022-11-25 18:29:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2022-11-25 18:29:36,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:36,097 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:36,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 18:29:36,098 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:36,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash 429639918, now seen corresponding path program 1 times [2022-11-25 18:29:36,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:36,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712762829] [2022-11-25 18:29:36,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:36,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:37,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:37,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712762829] [2022-11-25 18:29:37,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712762829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:37,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:37,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:29:37,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118233766] [2022-11-25 18:29:37,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:37,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:29:37,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:37,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:29:37,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:29:37,427 INFO L87 Difference]: Start difference. First operand 21415 states and 24298 transitions. Second operand has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 5 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:39,463 INFO L93 Difference]: Finished difference Result 50066 states and 56802 transitions. [2022-11-25 18:29:39,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:29:39,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 5 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 296 [2022-11-25 18:29:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:39,495 INFO L225 Difference]: With dead ends: 50066 [2022-11-25 18:29:39,496 INFO L226 Difference]: Without dead ends: 28963 [2022-11-25 18:29:39,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:29:39,512 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 212 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:39,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 193 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-25 18:29:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28963 states. [2022-11-25 18:29:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28963 to 27119. [2022-11-25 18:29:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27119 states, 27118 states have (on average 1.1250092189689505) internal successors, (30508), 27118 states have internal predecessors, (30508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27119 states to 27119 states and 30508 transitions. [2022-11-25 18:29:39,912 INFO L78 Accepts]: Start accepts. Automaton has 27119 states and 30508 transitions. Word has length 296 [2022-11-25 18:29:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:39,913 INFO L495 AbstractCegarLoop]: Abstraction has 27119 states and 30508 transitions. [2022-11-25 18:29:39,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 5 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:39,913 INFO L276 IsEmpty]: Start isEmpty. Operand 27119 states and 30508 transitions. [2022-11-25 18:29:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2022-11-25 18:29:39,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:39,919 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:39,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 18:29:39,919 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:39,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1076296472, now seen corresponding path program 1 times [2022-11-25 18:29:39,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:39,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529279004] [2022-11-25 18:29:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:39,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-25 18:29:40,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:40,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529279004] [2022-11-25 18:29:40,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529279004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:40,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:40,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:29:40,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266309484] [2022-11-25 18:29:40,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:40,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:40,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:40,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:40,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:40,432 INFO L87 Difference]: Start difference. First operand 27119 states and 30508 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:41,792 INFO L93 Difference]: Finished difference Result 54607 states and 61493 transitions. [2022-11-25 18:29:41,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:29:41,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 312 [2022-11-25 18:29:41,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:41,830 INFO L225 Difference]: With dead ends: 54607 [2022-11-25 18:29:41,830 INFO L226 Difference]: Without dead ends: 30068 [2022-11-25 18:29:41,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:41,846 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 192 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:41,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 152 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 18:29:41,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30068 states. [2022-11-25 18:29:42,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30068 to 26751. [2022-11-25 18:29:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26751 states, 26750 states have (on average 1.124785046728972) internal successors, (30088), 26750 states have internal predecessors, (30088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26751 states to 26751 states and 30088 transitions. [2022-11-25 18:29:42,351 INFO L78 Accepts]: Start accepts. Automaton has 26751 states and 30088 transitions. Word has length 312 [2022-11-25 18:29:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:42,351 INFO L495 AbstractCegarLoop]: Abstraction has 26751 states and 30088 transitions. [2022-11-25 18:29:42,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 26751 states and 30088 transitions. [2022-11-25 18:29:42,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-11-25 18:29:42,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:42,357 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:42,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 18:29:42,357 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:42,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:42,358 INFO L85 PathProgramCache]: Analyzing trace with hash -565242810, now seen corresponding path program 1 times [2022-11-25 18:29:42,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:42,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826997596] [2022-11-25 18:29:42,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:42,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:43,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:43,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826997596] [2022-11-25 18:29:43,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826997596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:43,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:43,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:29:43,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969710951] [2022-11-25 18:29:43,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:43,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:29:43,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:43,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:29:43,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:29:43,149 INFO L87 Difference]: Start difference. First operand 26751 states and 30088 transitions. Second operand has 5 states, 5 states have (on average 63.0) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:44,970 INFO L93 Difference]: Finished difference Result 53137 states and 59908 transitions. [2022-11-25 18:29:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:29:44,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 63.0) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 315 [2022-11-25 18:29:44,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:45,008 INFO L225 Difference]: With dead ends: 53137 [2022-11-25 18:29:45,008 INFO L226 Difference]: Without dead ends: 29150 [2022-11-25 18:29:45,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:29:45,026 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 310 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:45,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 172 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-25 18:29:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29150 states. [2022-11-25 18:29:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29150 to 28411. [2022-11-25 18:29:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28411 states, 28410 states have (on average 1.1203097500879973) internal successors, (31828), 28410 states have internal predecessors, (31828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28411 states to 28411 states and 31828 transitions. [2022-11-25 18:29:45,484 INFO L78 Accepts]: Start accepts. Automaton has 28411 states and 31828 transitions. Word has length 315 [2022-11-25 18:29:45,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:45,484 INFO L495 AbstractCegarLoop]: Abstraction has 28411 states and 31828 transitions. [2022-11-25 18:29:45,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.0) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 28411 states and 31828 transitions. [2022-11-25 18:29:45,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2022-11-25 18:29:45,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:45,490 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:45,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 18:29:45,491 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:45,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:45,492 INFO L85 PathProgramCache]: Analyzing trace with hash -666581394, now seen corresponding path program 1 times [2022-11-25 18:29:45,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:45,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238700737] [2022-11-25 18:29:45,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:45,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-25 18:29:45,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:45,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238700737] [2022-11-25 18:29:45,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238700737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:45,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:45,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:29:45,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63067851] [2022-11-25 18:29:45,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:45,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:45,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:45,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:45,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:45,954 INFO L87 Difference]: Start difference. First operand 28411 states and 31828 transitions. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:47,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:47,540 INFO L93 Difference]: Finished difference Result 54243 states and 60950 transitions. [2022-11-25 18:29:47,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:29:47,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2022-11-25 18:29:47,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:47,567 INFO L225 Difference]: With dead ends: 54243 [2022-11-25 18:29:47,567 INFO L226 Difference]: Without dead ends: 28228 [2022-11-25 18:29:47,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:47,578 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 247 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:47,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 68 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-25 18:29:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28228 states. [2022-11-25 18:29:47,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28228 to 28227. [2022-11-25 18:29:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28227 states, 28226 states have (on average 1.1184014738184653) internal successors, (31568), 28226 states have internal predecessors, (31568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:47,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28227 states to 28227 states and 31568 transitions. [2022-11-25 18:29:47,877 INFO L78 Accepts]: Start accepts. Automaton has 28227 states and 31568 transitions. Word has length 316 [2022-11-25 18:29:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:47,877 INFO L495 AbstractCegarLoop]: Abstraction has 28227 states and 31568 transitions. [2022-11-25 18:29:47,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:47,877 INFO L276 IsEmpty]: Start isEmpty. Operand 28227 states and 31568 transitions. [2022-11-25 18:29:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2022-11-25 18:29:47,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:47,882 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:47,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 18:29:47,882 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:47,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:47,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1751405250, now seen corresponding path program 1 times [2022-11-25 18:29:47,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:47,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835149863] [2022-11-25 18:29:47,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:47,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-11-25 18:29:48,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:48,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835149863] [2022-11-25 18:29:48,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835149863] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:29:48,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842399598] [2022-11-25 18:29:48,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:48,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:29:48,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:29:48,412 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:29:48,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:29:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:48,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:29:48,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:29:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-11-25 18:29:49,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:29:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-11-25 18:29:52,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842399598] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:29:52,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:29:52,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2022-11-25 18:29:52,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534655861] [2022-11-25 18:29:52,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:52,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:52,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:52,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:52,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:29:52,129 INFO L87 Difference]: Start difference. First operand 28227 states and 31568 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:53,769 INFO L93 Difference]: Finished difference Result 33945 states and 38313 transitions. [2022-11-25 18:29:53,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:29:53,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 327 [2022-11-25 18:29:53,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:53,798 INFO L225 Difference]: With dead ends: 33945 [2022-11-25 18:29:53,798 INFO L226 Difference]: Without dead ends: 33943 [2022-11-25 18:29:53,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:29:53,805 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 301 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:53,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 119 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 18:29:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33943 states. [2022-11-25 18:29:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33943 to 28963. [2022-11-25 18:29:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28963 states, 28962 states have (on average 1.1188108556038947) internal successors, (32403), 28962 states have internal predecessors, (32403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28963 states to 28963 states and 32403 transitions. [2022-11-25 18:29:54,166 INFO L78 Accepts]: Start accepts. Automaton has 28963 states and 32403 transitions. Word has length 327 [2022-11-25 18:29:54,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:54,167 INFO L495 AbstractCegarLoop]: Abstraction has 28963 states and 32403 transitions. [2022-11-25 18:29:54,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:54,167 INFO L276 IsEmpty]: Start isEmpty. Operand 28963 states and 32403 transitions. [2022-11-25 18:29:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2022-11-25 18:29:54,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:54,170 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:54,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 18:29:54,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-25 18:29:54,374 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:54,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:54,374 INFO L85 PathProgramCache]: Analyzing trace with hash -292724391, now seen corresponding path program 1 times [2022-11-25 18:29:54,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:54,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511721724] [2022-11-25 18:29:54,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:54,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 83 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:54,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511721724] [2022-11-25 18:29:54,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511721724] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:29:54,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234042384] [2022-11-25 18:29:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:54,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:29:54,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:29:54,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:29:55,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:29:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:55,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:29:55,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:29:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-11-25 18:29:55,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:29:55,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234042384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:55,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:29:55,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-11-25 18:29:55,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695198091] [2022-11-25 18:29:55,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:55,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:55,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:55,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:55,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:29:55,766 INFO L87 Difference]: Start difference. First operand 28963 states and 32403 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:57,118 INFO L93 Difference]: Finished difference Result 54985 states and 61702 transitions. [2022-11-25 18:29:57,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:29:57,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 338 [2022-11-25 18:29:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:57,147 INFO L225 Difference]: With dead ends: 54985 [2022-11-25 18:29:57,147 INFO L226 Difference]: Without dead ends: 28970 [2022-11-25 18:29:57,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:29:57,161 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 178 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:57,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 163 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 18:29:57,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28970 states. [2022-11-25 18:29:57,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28970 to 28411. [2022-11-25 18:29:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28411 states, 28410 states have (on average 1.1186906019007392) internal successors, (31782), 28410 states have internal predecessors, (31782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28411 states to 28411 states and 31782 transitions. [2022-11-25 18:29:57,562 INFO L78 Accepts]: Start accepts. Automaton has 28411 states and 31782 transitions. Word has length 338 [2022-11-25 18:29:57,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:57,562 INFO L495 AbstractCegarLoop]: Abstraction has 28411 states and 31782 transitions. [2022-11-25 18:29:57,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 28411 states and 31782 transitions. [2022-11-25 18:29:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2022-11-25 18:29:57,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:57,569 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:57,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:29:57,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:29:57,775 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:57,776 INFO L85 PathProgramCache]: Analyzing trace with hash 178883971, now seen corresponding path program 1 times [2022-11-25 18:29:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:57,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469855318] [2022-11-25 18:29:57,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 112 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:58,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:58,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469855318] [2022-11-25 18:29:58,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469855318] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:29:58,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267194094] [2022-11-25 18:29:58,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:58,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:29:58,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:29:58,763 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:29:58,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:29:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:58,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 18:29:58,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 112 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:00,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:30:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 112 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:04,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267194094] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:30:04,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:30:04,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-11-25 18:30:04,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653058242] [2022-11-25 18:30:04,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:30:04,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:30:04,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:30:04,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:30:04,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:30:04,235 INFO L87 Difference]: Start difference. First operand 28411 states and 31782 transitions. Second operand has 10 states, 10 states have (on average 61.7) internal successors, (617), 9 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:09,421 INFO L93 Difference]: Finished difference Result 58798 states and 65847 transitions. [2022-11-25 18:30:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:30:09,422 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 61.7) internal successors, (617), 9 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 338 [2022-11-25 18:30:09,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:09,455 INFO L225 Difference]: With dead ends: 58798 [2022-11-25 18:30:09,456 INFO L226 Difference]: Without dead ends: 30573 [2022-11-25 18:30:09,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 671 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:30:09,467 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1536 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 3412 mSolverCounterSat, 896 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 4308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 896 IncrementalHoareTripleChecker+Valid, 3412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:09,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 127 Invalid, 4308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [896 Valid, 3412 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-25 18:30:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30573 states. [2022-11-25 18:30:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30573 to 26386. [2022-11-25 18:30:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26386 states, 26385 states have (on average 1.1102520371423157) internal successors, (29294), 26385 states have internal predecessors, (29294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 29294 transitions. [2022-11-25 18:30:09,840 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 29294 transitions. Word has length 338 [2022-11-25 18:30:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:09,840 INFO L495 AbstractCegarLoop]: Abstraction has 26386 states and 29294 transitions. [2022-11-25 18:30:09,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 61.7) internal successors, (617), 9 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 29294 transitions. [2022-11-25 18:30:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2022-11-25 18:30:09,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:09,844 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:09,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:30:10,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:30:10,045 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:30:10,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash 306342123, now seen corresponding path program 1 times [2022-11-25 18:30:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:30:10,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647763887] [2022-11-25 18:30:10,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:10,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:30:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2022-11-25 18:30:10,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:30:10,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647763887] [2022-11-25 18:30:10,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647763887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:10,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:10,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:30:10,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134138601] [2022-11-25 18:30:10,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:10,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:30:10,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:30:10,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:30:10,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:30:10,347 INFO L87 Difference]: Start difference. First operand 26386 states and 29294 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:11,617 INFO L93 Difference]: Finished difference Result 50559 states and 56183 transitions. [2022-11-25 18:30:11,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:30:11,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2022-11-25 18:30:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:11,652 INFO L225 Difference]: With dead ends: 50559 [2022-11-25 18:30:11,653 INFO L226 Difference]: Without dead ends: 25831 [2022-11-25 18:30:11,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:30:11,667 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 194 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:11,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 346 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 18:30:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25831 states. [2022-11-25 18:30:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25831 to 25463. [2022-11-25 18:30:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25463 states, 25462 states have (on average 1.097242950278847) internal successors, (27938), 25462 states have internal predecessors, (27938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25463 states to 25463 states and 27938 transitions. [2022-11-25 18:30:11,984 INFO L78 Accepts]: Start accepts. Automaton has 25463 states and 27938 transitions. Word has length 344 [2022-11-25 18:30:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:11,984 INFO L495 AbstractCegarLoop]: Abstraction has 25463 states and 27938 transitions. [2022-11-25 18:30:11,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 25463 states and 27938 transitions. [2022-11-25 18:30:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2022-11-25 18:30:11,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:11,990 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:11,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 18:30:11,991 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:30:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:11,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1573654033, now seen corresponding path program 1 times [2022-11-25 18:30:11,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:30:11,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370982700] [2022-11-25 18:30:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:11,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:30:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-11-25 18:30:12,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:30:12,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370982700] [2022-11-25 18:30:12,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370982700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:12,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:12,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:30:12,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735048857] [2022-11-25 18:30:12,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:12,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:30:12,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:30:12,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:30:12,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:30:12,724 INFO L87 Difference]: Start difference. First operand 25463 states and 27938 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:14,012 INFO L93 Difference]: Finished difference Result 49094 states and 54135 transitions. [2022-11-25 18:30:14,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:30:14,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 397 [2022-11-25 18:30:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:14,037 INFO L225 Difference]: With dead ends: 49094 [2022-11-25 18:30:14,037 INFO L226 Difference]: Without dead ends: 26211 [2022-11-25 18:30:14,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:30:14,047 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 120 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:14,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 358 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 18:30:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26211 states. [2022-11-25 18:30:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26211 to 25837. [2022-11-25 18:30:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25837 states, 25836 states have (on average 1.0972673788512153) internal successors, (28349), 25836 states have internal predecessors, (28349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:14,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25837 states to 25837 states and 28349 transitions. [2022-11-25 18:30:14,358 INFO L78 Accepts]: Start accepts. Automaton has 25837 states and 28349 transitions. Word has length 397 [2022-11-25 18:30:14,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:14,359 INFO L495 AbstractCegarLoop]: Abstraction has 25837 states and 28349 transitions. [2022-11-25 18:30:14,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:14,359 INFO L276 IsEmpty]: Start isEmpty. Operand 25837 states and 28349 transitions. [2022-11-25 18:30:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2022-11-25 18:30:14,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:14,365 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:14,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 18:30:14,365 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:30:14,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:14,366 INFO L85 PathProgramCache]: Analyzing trace with hash 663206936, now seen corresponding path program 1 times [2022-11-25 18:30:14,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:30:14,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930547379] [2022-11-25 18:30:14,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:14,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:30:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:30:14,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:30:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:30:14,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:30:14,635 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:30:14,636 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 18:30:14,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 18:30:14,642 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:14,647 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:30:14,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:30:14 BoogieIcfgContainer [2022-11-25 18:30:14,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:30:14,931 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:30:14,931 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:30:14,931 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:30:14,932 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:28:58" (3/4) ... [2022-11-25 18:30:14,934 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 18:30:15,149 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:30:15,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:30:15,150 INFO L158 Benchmark]: Toolchain (without parser) took 80216.46ms. Allocated memory was 159.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 111.6MB in the beginning and 861.1MB in the end (delta: -749.5MB). Peak memory consumption was 815.5MB. Max. memory is 16.1GB. [2022-11-25 18:30:15,150 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 159.4MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:30:15,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 822.30ms. Allocated memory is still 159.4MB. Free memory was 111.0MB in the beginning and 66.9MB in the end (delta: 44.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-11-25 18:30:15,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 205.38ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 66.9MB in the beginning and 161.5MB in the end (delta: -94.5MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2022-11-25 18:30:15,152 INFO L158 Benchmark]: Boogie Preprocessor took 155.30ms. Allocated memory is still 207.6MB. Free memory was 161.5MB in the beginning and 152.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 18:30:15,155 INFO L158 Benchmark]: RCFGBuilder took 2219.47ms. Allocated memory is still 207.6MB. Free memory was 152.0MB in the beginning and 151.3MB in the end (delta: 674.6kB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. [2022-11-25 18:30:15,156 INFO L158 Benchmark]: TraceAbstraction took 76583.45ms. Allocated memory was 207.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 150.3MB in the beginning and 892.5MB in the end (delta: -742.3MB). Peak memory consumption was 774.0MB. Max. memory is 16.1GB. [2022-11-25 18:30:15,156 INFO L158 Benchmark]: Witness Printer took 218.75ms. Allocated memory is still 1.7GB. Free memory was 892.5MB in the beginning and 861.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-25 18:30:15,165 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.26ms. Allocated memory is still 159.4MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 822.30ms. Allocated memory is still 159.4MB. Free memory was 111.0MB in the beginning and 66.9MB in the end (delta: 44.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 205.38ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 66.9MB in the beginning and 161.5MB in the end (delta: -94.5MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 155.30ms. Allocated memory is still 207.6MB. Free memory was 161.5MB in the beginning and 152.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2219.47ms. Allocated memory is still 207.6MB. Free memory was 152.0MB in the beginning and 151.3MB in the end (delta: 674.6kB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. * TraceAbstraction took 76583.45ms. Allocated memory was 207.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 150.3MB in the beginning and 892.5MB in the end (delta: -742.3MB). Peak memory consumption was 774.0MB. Max. memory is 16.1GB. * Witness Printer took 218.75ms. Allocated memory is still 1.7GB. Free memory was 892.5MB in the beginning and 861.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 37]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputA = 1; [L18] int inputD = 4; [L19] int inputB = 2; [L20] int inputE = 5; [L21] int inputF = 6; [L22] int inputC = 3; [L25] int a29 = 130; [L26] int a4 = 1; [L27] int a23 = 312; [L28] int a8 = 15; [L29] int a25 = 10; [L30] int a3 = 1; VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1041] int output = -1; VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL, EXPR calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L344] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L356] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L368] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L387] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L401] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L439] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L453] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L480] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L541] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L547] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L559] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L576] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L582] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L585] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L591] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L596] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L608] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L638] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L645] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L652] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L668] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L673] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L680] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L727] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L741] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L748] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L753] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L760] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L767] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L779] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L790] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L802] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L809] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L826] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L832] COND FALSE !(( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND FALSE !(((a8==15) && ((((a3==1) && ((((a25==10) || (a25==11)) && (input == 6)) && a29 <= 140 )) && a23 <= -43 ) && !(a4==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((a8==15) && (((a25==13) || ((a25==11) || (a25==12))) && (input == 4))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L846] COND FALSE !((((a3==1) && ((a8==15) && ((((a25==13) && (input == 4)) && (a4==1)) && a29 <= 140 ))) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L851] COND FALSE !((( 306 < a23 && ((a25==13) && ((((input == 3) && a29 <= 140 ) && (a3==1)) && (a4==1)))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L856] COND FALSE !((!(a4==1) && (( 277 < a29 && ((((input == 4) && a23 <= -43 ) && (a8==15)) && (a3==1))) && (a25==13)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L862] COND FALSE !(((a3==1) && (((((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ) || (( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==12))) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13))))) && (input == 1)) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L869] COND FALSE !(( 277 < a29 && ((a3==1) && ((a8==15) && ((a4==1) && ( 306 < a23 && ((input == 6) && (((a25==9) || (a25==10)) || (a25==11))))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L875] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 4) && ((a25==12) || ((a25==10) || (a25==11))))) && (a8==15)) && !(a4==1)) && (a3==1)) && a29 <= 140 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L886] COND FALSE !(((((( a23 <= -43 && ((input == 5) && ((a25==12) || ((a25==10) || (a25==11))))) && (a3==1)) && !(a4==1)) && 277 < a29 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L891] COND FALSE !(((((a8==15) && ((a4==1) && (((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 2)))) && (a3==1)) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L896] COND FALSE !((( a23 <= -43 && ((( ((140 < a29) && (245 >= a29)) && ((input == 1) && (((a25==9) || (a25==10)) || (a25==11)))) && !(a4==1)) && (a8==15))) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L903] COND TRUE ((((a3==1) && ((((input == 2) && ((a25==12) || ((a25==10) || (a25==11)))) && (a4==1)) && (a8==15))) && a29 <= 140 ) && 306 < a23 ) [L905] a25 = 13 [L907] return 23; VAL [\old(input)=2, \result=23, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] RET, EXPR calculate_output(input) [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL, EXPR calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L344] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L356] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L368] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L387] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L401] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L439] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L453] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L480] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L541] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L547] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L559] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L576] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L582] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L585] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L591] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L596] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L608] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L638] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L645] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L652] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L668] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L673] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L680] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L727] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L741] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L748] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L753] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L760] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L767] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L779] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L790] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L802] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L809] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L826] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L832] COND TRUE ( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15))) [L833] a29 = (((a29 / 5) + 165004) + 41645) [L834] return 23; VAL [\old(input)=2, \result=23, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] RET, EXPR calculate_output(input) [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL, EXPR calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND TRUE ((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1)) [L251] a29 = ((((a29 / 5) % 15)+ 260) + 1) [L252] a23 = (((((a23 / 5) % 90)- -47) - -159208) - 159206) [L253] a4 = 1 [L254] a25 = 11 [L256] return -1; VAL [\old(input)=4, \result=-1, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] RET, EXPR calculate_output(input) [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=5, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND TRUE ((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)) VAL [\old(input)=5, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] reach_error() VAL [\old(input)=5, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.2s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 42.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6783 SdHoareTripleChecker+Valid, 36.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6783 mSDsluCounter, 4748 SdHoareTripleChecker+Invalid, 31.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 944 mSDsCounter, 3874 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24270 IncrementalHoareTripleChecker+Invalid, 28144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3874 mSolverCounterUnsat, 3804 mSDtfsCounter, 24270 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 1904 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28963occurred in iteration=22, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 20306 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 8015 NumberOfCodeBlocks, 8015 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 8249 ConstructedInterpolants, 0 QuantifiedInterpolants, 51730 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1752 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 32 InterpolantComputations, 25 PerfectInterpolantSequences, 4793/5506 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-25 18:30:15,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7edb1d2a-607f-4f23-9bb3-e3208eb949b3/bin/uautomizer-ZsLfNo2U6R/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