./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 954f50d37143b139a2ebc4626a6099455decd471f8c1055eb5e8a313dea8492b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:56:36,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:56:36,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:56:36,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:56:36,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:56:36,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:56:36,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:56:36,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:56:36,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:56:36,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:56:36,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:56:36,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:56:36,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:56:36,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:56:36,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:56:36,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:56:36,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:56:36,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:56:36,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:56:36,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:56:36,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:56:36,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:56:36,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:56:36,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:56:36,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:56:36,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:56:36,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:56:36,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:56:36,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:56:36,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:56:36,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:56:36,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:56:36,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:56:36,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:56:36,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:56:36,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:56:36,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:56:36,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:56:36,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:56:36,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:56:36,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:56:36,784 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:56:36,836 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:56:36,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:56:36,837 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:56:36,837 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:56:36,839 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:56:36,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:56:36,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:56:36,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:56:36,840 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:56:36,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:56:36,842 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:56:36,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:56:36,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:56:36,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:56:36,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:56:36,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:56:36,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:56:36,845 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:56:36,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:56:36,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:56:36,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:56:36,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:56:36,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:56:36,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:56:36,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:56:36,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:56:36,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:56:36,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:56:36,849 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:56:36,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:56:36,849 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:56:36,850 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:56:36,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:56:36,850 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 954f50d37143b139a2ebc4626a6099455decd471f8c1055eb5e8a313dea8492b [2022-11-20 10:56:37,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:56:37,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:56:37,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:56:37,306 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:56:37,307 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:56:37,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2022-11-20 10:56:41,212 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:56:41,634 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:56:41,634 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2022-11-20 10:56:41,662 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/data/4bdb5a248/786087ad33f54fceb445096503e08b84/FLAG62fc87c80 [2022-11-20 10:56:41,680 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/data/4bdb5a248/786087ad33f54fceb445096503e08b84 [2022-11-20 10:56:41,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:56:41,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:56:41,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:56:41,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:56:41,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:56:41,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:56:41" (1/1) ... [2022-11-20 10:56:41,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e81dd5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:41, skipping insertion in model container [2022-11-20 10:56:41,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:56:41" (1/1) ... [2022-11-20 10:56:41,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:56:41,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:56:42,154 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_8fa39b7c-be6d-49cb-b08a-bf257985fee7/sv-benchmarks/c/eca-rers2012/Problem15_label35.c[4490,4503] [2022-11-20 10:56:42,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:56:42,792 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:56:42,819 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_8fa39b7c-be6d-49cb-b08a-bf257985fee7/sv-benchmarks/c/eca-rers2012/Problem15_label35.c[4490,4503] [2022-11-20 10:56:43,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:56:43,138 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:56:43,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:43 WrapperNode [2022-11-20 10:56:43,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:56:43,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:56:43,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:56:43,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:56:43,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:43" (1/1) ... [2022-11-20 10:56:43,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:43" (1/1) ... [2022-11-20 10:56:43,464 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1758 [2022-11-20 10:56:43,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:56:43,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:56:43,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:56:43,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:56:43,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:43" (1/1) ... [2022-11-20 10:56:43,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:43" (1/1) ... [2022-11-20 10:56:43,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:43" (1/1) ... [2022-11-20 10:56:43,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:43" (1/1) ... [2022-11-20 10:56:43,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:43" (1/1) ... [2022-11-20 10:56:43,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:43" (1/1) ... [2022-11-20 10:56:43,664 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:43" (1/1) ... [2022-11-20 10:56:43,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:43" (1/1) ... [2022-11-20 10:56:43,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:56:43,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:56:43,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:56:43,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:56:43,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:43" (1/1) ... [2022-11-20 10:56:43,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:56:43,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:56:43,782 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:56:43,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:56:43,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:56:43,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:56:43,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:56:43,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:56:43,929 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:56:43,932 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:56:48,000 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:56:48,012 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:56:48,013 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 10:56:48,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:48 BoogieIcfgContainer [2022-11-20 10:56:48,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:56:48,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:56:48,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:56:48,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:56:48,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:56:41" (1/3) ... [2022-11-20 10:56:48,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2061f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:56:48, skipping insertion in model container [2022-11-20 10:56:48,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:43" (2/3) ... [2022-11-20 10:56:48,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2061f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:56:48, skipping insertion in model container [2022-11-20 10:56:48,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:48" (3/3) ... [2022-11-20 10:56:48,026 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label35.c [2022-11-20 10:56:48,051 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:56:48,051 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:56:48,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:56:48,130 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;@2a2bab38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:56:48,131 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:56:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 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-20 10:56:48,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 10:56:48,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:48,148 INFO L195 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:48,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:56:48,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:48,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2022-11-20 10:56:48,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:48,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099291966] [2022-11-20 10:56:48,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:48,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:48,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:48,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099291966] [2022-11-20 10:56:48,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099291966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:48,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:48,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:56:48,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574629071] [2022-11-20 10:56:48,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:48,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:56:48,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:48,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:56:48,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:56:48,693 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 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 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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-20 10:56:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:51,764 INFO L93 Difference]: Finished difference Result 1155 states and 2106 transitions. [2022-11-20 10:56:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:56:51,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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 36 [2022-11-20 10:56:51,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:51,786 INFO L225 Difference]: With dead ends: 1155 [2022-11-20 10:56:51,787 INFO L226 Difference]: Without dead ends: 667 [2022-11-20 10:56:51,792 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-20 10:56:51,796 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 308 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:51,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 371 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-20 10:56:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-11-20 10:56:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2022-11-20 10:56:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 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-20 10:56:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2022-11-20 10:56:51,879 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 36 [2022-11-20 10:56:51,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:51,880 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2022-11-20 10:56:51,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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-20 10:56:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2022-11-20 10:56:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-20 10:56:51,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:51,885 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 10:56:51,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:56:51,886 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:56:51,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash 532908861, now seen corresponding path program 1 times [2022-11-20 10:56:51,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:51,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784436274] [2022-11-20 10:56:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:51,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:52,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:52,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784436274] [2022-11-20 10:56:52,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784436274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:52,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:52,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:56:52,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119260472] [2022-11-20 10:56:52,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:52,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:56:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:52,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:56:52,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:56:52,242 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-20 10:56:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:55,562 INFO L93 Difference]: Finished difference Result 1953 states and 2893 transitions. [2022-11-20 10:56:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:56:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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 111 [2022-11-20 10:56:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:55,570 INFO L225 Difference]: With dead ends: 1953 [2022-11-20 10:56:55,570 INFO L226 Difference]: Without dead ends: 1290 [2022-11-20 10:56:55,573 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-20 10:56:55,584 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 257 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:55,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 325 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-20 10:56:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-11-20 10:56:55,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282. [2022-11-20 10:56:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 1.3989071038251366) internal successors, (1792), 1281 states have internal predecessors, (1792), 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-20 10:56:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1792 transitions. [2022-11-20 10:56:55,664 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1792 transitions. Word has length 111 [2022-11-20 10:56:55,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:55,665 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1792 transitions. [2022-11-20 10:56:55,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-20 10:56:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1792 transitions. [2022-11-20 10:56:55,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-20 10:56:55,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:55,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 10:56:55,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:56:55,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:56:55,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:55,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1986106637, now seen corresponding path program 1 times [2022-11-20 10:56:55,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:55,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567118936] [2022-11-20 10:56:55,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:55,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:55,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:55,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567118936] [2022-11-20 10:56:55,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567118936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:55,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:55,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:56:55,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646605141] [2022-11-20 10:56:55,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:55,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:56:55,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:55,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:56:55,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:56:55,916 INFO L87 Difference]: Start difference. First operand 1282 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-20 10:56:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:59,235 INFO L93 Difference]: Finished difference Result 3764 states and 5263 transitions. [2022-11-20 10:56:59,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:56:59,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 115 [2022-11-20 10:56:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:59,252 INFO L225 Difference]: With dead ends: 3764 [2022-11-20 10:56:59,253 INFO L226 Difference]: Without dead ends: 2484 [2022-11-20 10:56:59,256 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-20 10:56:59,258 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:59,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 366 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-20 10:56:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2022-11-20 10:56:59,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2182. [2022-11-20 10:56:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2181 states have (on average 1.2815222375057314) internal successors, (2795), 2181 states have internal predecessors, (2795), 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-20 10:56:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2795 transitions. [2022-11-20 10:56:59,314 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2795 transitions. Word has length 115 [2022-11-20 10:56:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:59,317 INFO L495 AbstractCegarLoop]: Abstraction has 2182 states and 2795 transitions. [2022-11-20 10:56:59,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-20 10:56:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2795 transitions. [2022-11-20 10:56:59,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-11-20 10:56:59,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:59,336 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:59,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:56:59,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:56:59,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:59,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1703382585, now seen corresponding path program 1 times [2022-11-20 10:56:59,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:59,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378573058] [2022-11-20 10:56:59,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:59,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-20 10:56:59,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:59,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378573058] [2022-11-20 10:56:59,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378573058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:59,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:59,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:56:59,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496914593] [2022-11-20 10:56:59,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:59,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:56:59,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:59,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:56:59,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:56:59,784 INFO L87 Difference]: Start difference. First operand 2182 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-20 10:57:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:02,365 INFO L93 Difference]: Finished difference Result 6166 states and 7961 transitions. [2022-11-20 10:57:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:02,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 206 [2022-11-20 10:57:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:02,381 INFO L225 Difference]: With dead ends: 6166 [2022-11-20 10:57:02,381 INFO L226 Difference]: Without dead ends: 3986 [2022-11-20 10:57:02,385 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-20 10:57:02,386 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:02,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-20 10:57:02,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2022-11-20 10:57:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3682. [2022-11-20 10:57:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3681 states have (on average 1.2200488997555012) internal successors, (4491), 3681 states have internal predecessors, (4491), 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-20 10:57:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4491 transitions. [2022-11-20 10:57:02,474 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4491 transitions. Word has length 206 [2022-11-20 10:57:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:02,474 INFO L495 AbstractCegarLoop]: Abstraction has 3682 states and 4491 transitions. [2022-11-20 10:57:02,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-20 10:57:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4491 transitions. [2022-11-20 10:57:02,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-11-20 10:57:02,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:02,483 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:57:02,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:57:02,484 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:02,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:02,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2135107277, now seen corresponding path program 1 times [2022-11-20 10:57:02,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:02,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829839356] [2022-11-20 10:57:02,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:02,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 10:57:03,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:03,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829839356] [2022-11-20 10:57:03,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829839356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:03,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:03,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:57:03,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335335093] [2022-11-20 10:57:03,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:03,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:57:03,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:03,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:57:03,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:57:03,728 INFO L87 Difference]: Start difference. First operand 3682 states and 4491 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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-20 10:57:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:06,260 INFO L93 Difference]: Finished difference Result 7661 states and 9291 transitions. [2022-11-20 10:57:06,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:06,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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 308 [2022-11-20 10:57:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:06,277 INFO L225 Difference]: With dead ends: 7661 [2022-11-20 10:57:06,277 INFO L226 Difference]: Without dead ends: 3981 [2022-11-20 10:57:06,282 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-20 10:57:06,285 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:06,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-20 10:57:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2022-11-20 10:57:06,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2022-11-20 10:57:06,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3980 states have (on average 1.2050251256281408) internal successors, (4796), 3980 states have internal predecessors, (4796), 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-20 10:57:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4796 transitions. [2022-11-20 10:57:06,384 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 4796 transitions. Word has length 308 [2022-11-20 10:57:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:06,386 INFO L495 AbstractCegarLoop]: Abstraction has 3981 states and 4796 transitions. [2022-11-20 10:57:06,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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-20 10:57:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 4796 transitions. [2022-11-20 10:57:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2022-11-20 10:57:06,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:06,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:57:06,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:57:06,400 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:06,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:06,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1741911394, now seen corresponding path program 1 times [2022-11-20 10:57:06,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:06,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852035745] [2022-11-20 10:57:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:06,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-20 10:57:06,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:06,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852035745] [2022-11-20 10:57:06,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852035745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:06,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:06,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:06,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865258206] [2022-11-20 10:57:06,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:06,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:57:06,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:06,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:57:06,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:57:06,951 INFO L87 Difference]: Start difference. First operand 3981 states and 4796 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-20 10:57:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:09,766 INFO L93 Difference]: Finished difference Result 9465 states and 11674 transitions. [2022-11-20 10:57:09,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:09,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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 323 [2022-11-20 10:57:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:09,787 INFO L225 Difference]: With dead ends: 9465 [2022-11-20 10:57:09,787 INFO L226 Difference]: Without dead ends: 5785 [2022-11-20 10:57:09,792 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-20 10:57:09,793 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 280 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:09,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 671 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-20 10:57:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2022-11-20 10:57:09,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5783. [2022-11-20 10:57:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5783 states, 5782 states have (on average 1.1675890695261155) internal successors, (6751), 5782 states have internal predecessors, (6751), 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-20 10:57:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 6751 transitions. [2022-11-20 10:57:09,923 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 6751 transitions. Word has length 323 [2022-11-20 10:57:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:09,924 INFO L495 AbstractCegarLoop]: Abstraction has 5783 states and 6751 transitions. [2022-11-20 10:57:09,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-20 10:57:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 6751 transitions. [2022-11-20 10:57:09,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2022-11-20 10:57:09,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:09,935 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:57:09,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:57:09,936 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:09,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:09,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1792802591, now seen corresponding path program 1 times [2022-11-20 10:57:09,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:09,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033356545] [2022-11-20 10:57:09,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:09,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-20 10:57:10,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:10,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033356545] [2022-11-20 10:57:10,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033356545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:10,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:10,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:10,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822438218] [2022-11-20 10:57:10,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:10,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:57:10,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:10,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:57:10,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:57:10,490 INFO L87 Difference]: Start difference. First operand 5783 states and 6751 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-20 10:57:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:13,286 INFO L93 Difference]: Finished difference Result 13364 states and 15910 transitions. [2022-11-20 10:57:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:13,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 382 [2022-11-20 10:57:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:13,312 INFO L225 Difference]: With dead ends: 13364 [2022-11-20 10:57:13,312 INFO L226 Difference]: Without dead ends: 7882 [2022-11-20 10:57:13,318 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-20 10:57:13,323 INFO L413 NwaCegarLoop]: 598 mSDtfsCounter, 291 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:13,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 635 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-20 10:57:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7882 states. [2022-11-20 10:57:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7882 to 7284. [2022-11-20 10:57:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7284 states, 7283 states have (on average 1.148702457778388) internal successors, (8366), 7283 states have internal predecessors, (8366), 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-20 10:57:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 8366 transitions. [2022-11-20 10:57:13,494 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 8366 transitions. Word has length 382 [2022-11-20 10:57:13,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:13,495 INFO L495 AbstractCegarLoop]: Abstraction has 7284 states and 8366 transitions. [2022-11-20 10:57:13,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-20 10:57:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 8366 transitions. [2022-11-20 10:57:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2022-11-20 10:57:13,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:13,507 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:57:13,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:57:13,508 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:13,509 INFO L85 PathProgramCache]: Analyzing trace with hash 746313456, now seen corresponding path program 1 times [2022-11-20 10:57:13,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:13,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915017457] [2022-11-20 10:57:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:13,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-20 10:57:13,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:13,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915017457] [2022-11-20 10:57:13,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915017457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:13,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:13,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:13,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153589237] [2022-11-20 10:57:13,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:13,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:57:13,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:57:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:57:13,982 INFO L87 Difference]: Start difference. First operand 7284 states and 8366 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-20 10:57:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:16,622 INFO L93 Difference]: Finished difference Result 16069 states and 18814 transitions. [2022-11-20 10:57:16,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:16,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-20 10:57:16,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:16,653 INFO L225 Difference]: With dead ends: 16069 [2022-11-20 10:57:16,654 INFO L226 Difference]: Without dead ends: 9086 [2022-11-20 10:57:16,659 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-20 10:57:16,660 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 293 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:16,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 623 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-20 10:57:16,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2022-11-20 10:57:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 8481. [2022-11-20 10:57:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8481 states, 8480 states have (on average 1.1379716981132075) internal successors, (9650), 8480 states have internal predecessors, (9650), 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-20 10:57:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 9650 transitions. [2022-11-20 10:57:16,836 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 9650 transitions. Word has length 397 [2022-11-20 10:57:16,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:16,837 INFO L495 AbstractCegarLoop]: Abstraction has 8481 states and 9650 transitions. [2022-11-20 10:57:16,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-20 10:57:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 9650 transitions. [2022-11-20 10:57:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2022-11-20 10:57:16,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:16,843 INFO L195 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:57:16,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:57:16,843 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:16,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:16,844 INFO L85 PathProgramCache]: Analyzing trace with hash 843512261, now seen corresponding path program 1 times [2022-11-20 10:57:16,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:16,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252863113] [2022-11-20 10:57:16,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:16,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-20 10:57:17,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:17,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252863113] [2022-11-20 10:57:17,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252863113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:17,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:17,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:17,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873274325] [2022-11-20 10:57:17,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:17,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:57:17,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:17,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:57:17,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:57:17,370 INFO L87 Difference]: Start difference. First operand 8481 states and 9650 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-20 10:57:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:20,358 INFO L93 Difference]: Finished difference Result 19651 states and 22543 transitions. [2022-11-20 10:57:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:20,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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 487 [2022-11-20 10:57:20,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:20,386 INFO L225 Difference]: With dead ends: 19651 [2022-11-20 10:57:20,386 INFO L226 Difference]: Without dead ends: 11471 [2022-11-20 10:57:20,394 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-20 10:57:20,395 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:20,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 315 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-20 10:57:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2022-11-20 10:57:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 7578. [2022-11-20 10:57:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 7577 states have (on average 1.1486076283489508) internal successors, (8703), 7577 states have internal predecessors, (8703), 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-20 10:57:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 8703 transitions. [2022-11-20 10:57:20,563 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 8703 transitions. Word has length 487 [2022-11-20 10:57:20,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:20,564 INFO L495 AbstractCegarLoop]: Abstraction has 7578 states and 8703 transitions. [2022-11-20 10:57:20,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-20 10:57:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 8703 transitions. [2022-11-20 10:57:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2022-11-20 10:57:20,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:20,571 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:57:20,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:57:20,572 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:20,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:20,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1011437163, now seen corresponding path program 1 times [2022-11-20 10:57:20,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:20,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205928923] [2022-11-20 10:57:20,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:20,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 477 proven. 39 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-11-20 10:57:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:21,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205928923] [2022-11-20 10:57:21,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205928923] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:57:21,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003465848] [2022-11-20 10:57:21,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:21,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:21,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:21,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:57:21,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:57:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:22,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:57:22,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:57:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-11-20 10:57:22,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:57:22,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003465848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:22,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:57:22,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-20 10:57:22,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251766946] [2022-11-20 10:57:22,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:22,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:57:22,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:22,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:57:22,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:22,183 INFO L87 Difference]: Start difference. First operand 7578 states and 8703 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-20 10:57:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:24,828 INFO L93 Difference]: Finished difference Result 17246 states and 20055 transitions. [2022-11-20 10:57:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:24,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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 520 [2022-11-20 10:57:24,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:24,845 INFO L225 Difference]: With dead ends: 17246 [2022-11-20 10:57:24,846 INFO L226 Difference]: Without dead ends: 9969 [2022-11-20 10:57:24,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:24,852 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 381 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:24,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 447 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-20 10:57:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9969 states. [2022-11-20 10:57:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9969 to 9969. [2022-11-20 10:57:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9969 states, 9968 states have (on average 1.1499799357945426) internal successors, (11463), 9968 states have internal predecessors, (11463), 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-20 10:57:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9969 states to 9969 states and 11463 transitions. [2022-11-20 10:57:25,001 INFO L78 Accepts]: Start accepts. Automaton has 9969 states and 11463 transitions. Word has length 520 [2022-11-20 10:57:25,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:25,002 INFO L495 AbstractCegarLoop]: Abstraction has 9969 states and 11463 transitions. [2022-11-20 10:57:25,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-20 10:57:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 9969 states and 11463 transitions. [2022-11-20 10:57:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2022-11-20 10:57:25,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:25,007 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:57:25,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:57:25,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 10:57:25,213 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:25,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:25,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1710037215, now seen corresponding path program 1 times [2022-11-20 10:57:25,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:25,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814840065] [2022-11-20 10:57:25,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:25,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-11-20 10:57:26,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:26,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814840065] [2022-11-20 10:57:26,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814840065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:26,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:26,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:26,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053548551] [2022-11-20 10:57:26,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:26,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:57:26,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:26,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:57:26,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:57:26,050 INFO L87 Difference]: Start difference. First operand 9969 states and 11463 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-20 10:57:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:28,953 INFO L93 Difference]: Finished difference Result 24136 states and 28002 transitions. [2022-11-20 10:57:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:28,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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 524 [2022-11-20 10:57:28,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:28,984 INFO L225 Difference]: With dead ends: 24136 [2022-11-20 10:57:28,984 INFO L226 Difference]: Without dead ends: 14468 [2022-11-20 10:57:28,992 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-20 10:57:28,994 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:28,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-20 10:57:29,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14468 states. [2022-11-20 10:57:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14468 to 14158. [2022-11-20 10:57:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14158 states, 14157 states have (on average 1.1348449530267712) internal successors, (16066), 14157 states have internal predecessors, (16066), 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-20 10:57:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 16066 transitions. [2022-11-20 10:57:29,256 INFO L78 Accepts]: Start accepts. Automaton has 14158 states and 16066 transitions. Word has length 524 [2022-11-20 10:57:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:29,258 INFO L495 AbstractCegarLoop]: Abstraction has 14158 states and 16066 transitions. [2022-11-20 10:57:29,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-20 10:57:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 14158 states and 16066 transitions. [2022-11-20 10:57:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2022-11-20 10:57:29,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:29,269 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:57:29,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:57:29,269 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:29,270 INFO L85 PathProgramCache]: Analyzing trace with hash -531161142, now seen corresponding path program 1 times [2022-11-20 10:57:29,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:29,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464692286] [2022-11-20 10:57:29,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:29,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 634 proven. 39 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2022-11-20 10:57:30,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:30,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464692286] [2022-11-20 10:57:30,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464692286] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:57:30,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824664539] [2022-11-20 10:57:30,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:30,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:30,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:30,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:57:30,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:57:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:30,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:57:30,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:57:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-11-20 10:57:31,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:57:31,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824664539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:31,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:57:31,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-20 10:57:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684328972] [2022-11-20 10:57:31,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:31,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:57:31,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:31,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:57:31,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:31,124 INFO L87 Difference]: Start difference. First operand 14158 states and 16066 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-20 10:57:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:33,596 INFO L93 Difference]: Finished difference Result 27712 states and 31490 transitions. [2022-11-20 10:57:33,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:33,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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 599 [2022-11-20 10:57:33,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:33,616 INFO L225 Difference]: With dead ends: 27712 [2022-11-20 10:57:33,616 INFO L226 Difference]: Without dead ends: 13855 [2022-11-20 10:57:33,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:33,628 INFO L413 NwaCegarLoop]: 567 mSDtfsCounter, 252 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:33,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 604 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-20 10:57:33,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13855 states. [2022-11-20 10:57:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13855 to 13854. [2022-11-20 10:57:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13854 states, 13853 states have (on average 1.081642965422652) internal successors, (14984), 13853 states have internal predecessors, (14984), 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-20 10:57:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13854 states to 13854 states and 14984 transitions. [2022-11-20 10:57:33,853 INFO L78 Accepts]: Start accepts. Automaton has 13854 states and 14984 transitions. Word has length 599 [2022-11-20 10:57:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:33,855 INFO L495 AbstractCegarLoop]: Abstraction has 13854 states and 14984 transitions. [2022-11-20 10:57:33,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-20 10:57:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 13854 states and 14984 transitions. [2022-11-20 10:57:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2022-11-20 10:57:33,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:33,865 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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-20 10:57:33,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:57:34,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:34,073 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:34,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1926565044, now seen corresponding path program 1 times [2022-11-20 10:57:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:34,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252201569] [2022-11-20 10:57:34,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:34,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-20 10:57:35,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:35,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252201569] [2022-11-20 10:57:35,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252201569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:57:35,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552945240] [2022-11-20 10:57:35,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:35,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:35,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:35,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:57:35,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:57:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:35,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:57:35,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:57:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-20 10:57:36,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:57:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-20 10:57:37,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552945240] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:57:37,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:57:37,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-11-20 10:57:37,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282920817] [2022-11-20 10:57:37,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:57:37,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:57:37,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:37,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:57:37,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:57:37,894 INFO L87 Difference]: Start difference. First operand 13854 states and 14984 transitions. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 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-20 10:57:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:47,938 INFO L93 Difference]: Finished difference Result 35741 states and 38659 transitions. [2022-11-20 10:57:47,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:57:47,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 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 600 [2022-11-20 10:57:47,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:47,964 INFO L225 Difference]: With dead ends: 35741 [2022-11-20 10:57:47,965 INFO L226 Difference]: Without dead ends: 16247 [2022-11-20 10:57:47,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1209 GetRequests, 1194 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:57:47,977 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 2894 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 5609 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2894 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 6257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 5609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:47,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2894 Valid, 242 Invalid, 6257 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [648 Valid, 5609 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-11-20 10:57:47,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16247 states. [2022-11-20 10:57:48,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16247 to 12357. [2022-11-20 10:57:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12357 states, 12356 states have (on average 1.0386047264486888) internal successors, (12833), 12356 states have internal predecessors, (12833), 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-20 10:57:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12357 states to 12357 states and 12833 transitions. [2022-11-20 10:57:48,210 INFO L78 Accepts]: Start accepts. Automaton has 12357 states and 12833 transitions. Word has length 600 [2022-11-20 10:57:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:48,211 INFO L495 AbstractCegarLoop]: Abstraction has 12357 states and 12833 transitions. [2022-11-20 10:57:48,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 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-20 10:57:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 12357 states and 12833 transitions. [2022-11-20 10:57:48,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2022-11-20 10:57:48,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:48,264 INFO L195 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 10:57:48,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-20 10:57:48,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 10:57:48,465 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:48,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:48,466 INFO L85 PathProgramCache]: Analyzing trace with hash 366324416, now seen corresponding path program 1 times [2022-11-20 10:57:48,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:48,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630452497] [2022-11-20 10:57:48,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:48,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2022-11-20 10:57:49,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:49,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630452497] [2022-11-20 10:57:49,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630452497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:49,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:49,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:49,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587192583] [2022-11-20 10:57:49,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:49,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:57:49,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:49,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:57:49,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:57:49,054 INFO L87 Difference]: Start difference. First operand 12357 states and 12833 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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-20 10:57:50,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:50,750 INFO L93 Difference]: Finished difference Result 28295 states and 29436 transitions. [2022-11-20 10:57:50,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:50,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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 637 [2022-11-20 10:57:50,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:50,769 INFO L225 Difference]: With dead ends: 28295 [2022-11-20 10:57:50,769 INFO L226 Difference]: Without dead ends: 15940 [2022-11-20 10:57:50,778 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-20 10:57:50,779 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 278 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:50,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 536 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-20 10:57:50,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2022-11-20 10:57:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 15043. [2022-11-20 10:57:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15043 states, 15042 states have (on average 1.032974338518814) internal successors, (15538), 15042 states have internal predecessors, (15538), 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-20 10:57:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 15538 transitions. [2022-11-20 10:57:51,020 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 15538 transitions. Word has length 637 [2022-11-20 10:57:51,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:51,021 INFO L495 AbstractCegarLoop]: Abstraction has 15043 states and 15538 transitions. [2022-11-20 10:57:51,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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-20 10:57:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 15538 transitions. [2022-11-20 10:57:51,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2022-11-20 10:57:51,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:51,034 INFO L195 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 10:57:51,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:57:51,035 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:51,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1686621216, now seen corresponding path program 1 times [2022-11-20 10:57:51,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:51,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061806426] [2022-11-20 10:57:51,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:51,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-20 10:57:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:52,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061806426] [2022-11-20 10:57:52,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061806426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:52,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:52,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:52,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000867875] [2022-11-20 10:57:52,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:52,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:57:52,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:52,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:57:52,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:57:52,059 INFO L87 Difference]: Start difference. First operand 15043 states and 15538 transitions. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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-20 10:57:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:53,733 INFO L93 Difference]: Finished difference Result 33081 states and 34229 transitions. [2022-11-20 10:57:53,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:53,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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 661 [2022-11-20 10:57:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:53,751 INFO L225 Difference]: With dead ends: 33081 [2022-11-20 10:57:53,751 INFO L226 Difference]: Without dead ends: 18339 [2022-11-20 10:57:53,763 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-20 10:57:53,765 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 87 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:53,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 512 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-20 10:57:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18339 states. [2022-11-20 10:57:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18339 to 18038. [2022-11-20 10:57:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18038 states, 18037 states have (on average 1.0326550978544105) internal successors, (18626), 18037 states have internal predecessors, (18626), 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-20 10:57:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18038 states to 18038 states and 18626 transitions. [2022-11-20 10:57:54,146 INFO L78 Accepts]: Start accepts. Automaton has 18038 states and 18626 transitions. Word has length 661 [2022-11-20 10:57:54,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:54,147 INFO L495 AbstractCegarLoop]: Abstraction has 18038 states and 18626 transitions. [2022-11-20 10:57:54,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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-20 10:57:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 18038 states and 18626 transitions. [2022-11-20 10:57:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2022-11-20 10:57:54,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:54,168 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:57:54,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:57:54,168 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:54,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:54,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1912380469, now seen corresponding path program 1 times [2022-11-20 10:57:54,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:54,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807544119] [2022-11-20 10:57:54,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:54,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2022-11-20 10:57:54,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:54,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807544119] [2022-11-20 10:57:54,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807544119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:54,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:54,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850707665] [2022-11-20 10:57:54,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:54,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:57:54,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:54,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:57:54,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:57:54,916 INFO L87 Difference]: Start difference. First operand 18038 states and 18626 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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-20 10:57:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:56,750 INFO L93 Difference]: Finished difference Result 38762 states and 40068 transitions. [2022-11-20 10:57:56,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:56,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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 763 [2022-11-20 10:57:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:56,780 INFO L225 Difference]: With dead ends: 38762 [2022-11-20 10:57:56,781 INFO L226 Difference]: Without dead ends: 20726 [2022-11-20 10:57:56,795 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-20 10:57:56,796 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 183 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:56,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 171 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-20 10:57:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20726 states. [2022-11-20 10:57:57,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20726 to 19829. [2022-11-20 10:57:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19829 states, 19828 states have (on average 1.030260238047206) internal successors, (20428), 19828 states have internal predecessors, (20428), 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-20 10:57:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19829 states to 19829 states and 20428 transitions. [2022-11-20 10:57:57,152 INFO L78 Accepts]: Start accepts. Automaton has 19829 states and 20428 transitions. Word has length 763 [2022-11-20 10:57:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:57,153 INFO L495 AbstractCegarLoop]: Abstraction has 19829 states and 20428 transitions. [2022-11-20 10:57:57,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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-20 10:57:57,154 INFO L276 IsEmpty]: Start isEmpty. Operand 19829 states and 20428 transitions. [2022-11-20 10:57:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2022-11-20 10:57:57,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:57,178 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 10:57:57,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:57:57,179 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:57,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:57,180 INFO L85 PathProgramCache]: Analyzing trace with hash 160756345, now seen corresponding path program 1 times [2022-11-20 10:57:57,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:57,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341618339] [2022-11-20 10:57:57,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:57,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2022-11-20 10:57:57,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:57,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341618339] [2022-11-20 10:57:57,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341618339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:57,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:57,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:57,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866161974] [2022-11-20 10:57:57,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:57,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:57:57,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:57,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:57:57,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:57:57,990 INFO L87 Difference]: Start difference. First operand 19829 states and 20428 transitions. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-20 10:57:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:59,672 INFO L93 Difference]: Finished difference Result 42641 states and 44001 transitions. [2022-11-20 10:57:59,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:59,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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 821 [2022-11-20 10:57:59,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:59,696 INFO L225 Difference]: With dead ends: 42641 [2022-11-20 10:57:59,696 INFO L226 Difference]: Without dead ends: 23113 [2022-11-20 10:57:59,707 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-20 10:57:59,708 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 314 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:59,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 505 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-20 10:57:59,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23113 states. [2022-11-20 10:57:59,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23113 to 19820. [2022-11-20 10:57:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19820 states, 19819 states have (on average 1.0282052575811091) internal successors, (20378), 19819 states have internal predecessors, (20378), 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-20 10:57:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19820 states to 19820 states and 20378 transitions. [2022-11-20 10:57:59,964 INFO L78 Accepts]: Start accepts. Automaton has 19820 states and 20378 transitions. Word has length 821 [2022-11-20 10:57:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:59,965 INFO L495 AbstractCegarLoop]: Abstraction has 19820 states and 20378 transitions. [2022-11-20 10:57:59,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-20 10:57:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 19820 states and 20378 transitions. [2022-11-20 10:57:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2022-11-20 10:57:59,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:59,989 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 10:57:59,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 10:57:59,990 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:59,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:59,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1504524939, now seen corresponding path program 1 times [2022-11-20 10:57:59,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:59,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749226867] [2022-11-20 10:57:59,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:59,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 587 proven. 269 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-20 10:58:02,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:02,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749226867] [2022-11-20 10:58:02,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749226867] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:58:02,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267069370] [2022-11-20 10:58:02,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:02,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:58:02,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:58:02,363 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:58:02,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:58:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:02,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:58:02,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2022-11-20 10:58:02,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:58:02,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267069370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:02,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:58:02,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-20 10:58:02,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443054838] [2022-11-20 10:58:02,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:02,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:58:02,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:02,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:58:02,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:58:02,920 INFO L87 Difference]: Start difference. First operand 19820 states and 20378 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 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-20 10:58:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:04,786 INFO L93 Difference]: Finished difference Result 43838 states and 45054 transitions. [2022-11-20 10:58:04,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:58:04,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 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 842 [2022-11-20 10:58:04,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:04,808 INFO L225 Difference]: With dead ends: 43838 [2022-11-20 10:58:04,808 INFO L226 Difference]: Without dead ends: 24319 [2022-11-20 10:58:04,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 841 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:58:04,822 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 293 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:04,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 496 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-20 10:58:04,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24319 states. [2022-11-20 10:58:05,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24319 to 21917. [2022-11-20 10:58:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21917 states, 21916 states have (on average 1.0275141449169556) internal successors, (22519), 21916 states have internal predecessors, (22519), 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-20 10:58:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21917 states to 21917 states and 22519 transitions. [2022-11-20 10:58:05,220 INFO L78 Accepts]: Start accepts. Automaton has 21917 states and 22519 transitions. Word has length 842 [2022-11-20 10:58:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:05,221 INFO L495 AbstractCegarLoop]: Abstraction has 21917 states and 22519 transitions. [2022-11-20 10:58:05,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 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-20 10:58:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 21917 states and 22519 transitions. [2022-11-20 10:58:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2022-11-20 10:58:05,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:05,253 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:58:05,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:58:05,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 10:58:05,461 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:58:05,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1397744587, now seen corresponding path program 1 times [2022-11-20 10:58:05,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:05,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581560663] [2022-11-20 10:58:05,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:05,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2022-11-20 10:58:06,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:06,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581560663] [2022-11-20 10:58:06,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581560663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:06,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:06,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:58:06,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653117626] [2022-11-20 10:58:06,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:06,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:58:06,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:06,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:58:06,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:58:06,850 INFO L87 Difference]: Start difference. First operand 21917 states and 22519 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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-20 10:58:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:08,833 INFO L93 Difference]: Finished difference Result 47734 states and 49018 transitions. [2022-11-20 10:58:08,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:58:08,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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 875 [2022-11-20 10:58:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:08,865 INFO L225 Difference]: With dead ends: 47734 [2022-11-20 10:58:08,866 INFO L226 Difference]: Without dead ends: 25819 [2022-11-20 10:58:08,879 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-20 10:58:08,880 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 142 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:08,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 492 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-20 10:58:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25819 states. [2022-11-20 10:58:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25819 to 21615. [2022-11-20 10:58:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21615 states, 21614 states have (on average 1.0270657906912186) internal successors, (22199), 21614 states have internal predecessors, (22199), 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-20 10:58:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21615 states to 21615 states and 22199 transitions. [2022-11-20 10:58:09,145 INFO L78 Accepts]: Start accepts. Automaton has 21615 states and 22199 transitions. Word has length 875 [2022-11-20 10:58:09,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:09,145 INFO L495 AbstractCegarLoop]: Abstraction has 21615 states and 22199 transitions. [2022-11-20 10:58:09,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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-20 10:58:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 21615 states and 22199 transitions. [2022-11-20 10:58:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2022-11-20 10:58:09,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:09,159 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:09,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 10:58:09,160 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:58:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash -547488288, now seen corresponding path program 1 times [2022-11-20 10:58:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:09,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645991861] [2022-11-20 10:58:09,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:09,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 661 proven. 269 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-20 10:58:11,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:11,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645991861] [2022-11-20 10:58:11,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645991861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:58:11,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768473406] [2022-11-20 10:58:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:11,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:58:11,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:58:11,135 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:58:11,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fa39b7c-be6d-49cb-b08a-bf257985fee7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:58:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:11,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:58:11,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:06:02,779 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 42 c_~a29~0)) (.cse2 (+ c_~a29~0 13))) (or (exists ((v_~a29~0_899 Int)) (let ((.cse0 (* 9 v_~a29~0_899))) (let ((.cse3 (+ (div .cse0 10) 1))) (let ((.cse1 (div .cse3 5))) (and (= (mod (+ (div .cse0 50) 1) 29) 0) (not (< (+ .cse1 1) 0)) (<= (mod .cse1 29) .cse2) (< .cse0 0) (= (mod .cse3 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse9 (* 9 v_~a29~0_899))) (let ((.cse4 (div .cse9 50)) (.cse5 (div .cse9 10))) (let ((.cse6 (div (+ .cse5 1) 5)) (.cse7 (+ .cse4 1))) (and (not (= 0 (mod .cse4 29))) (not (= (mod .cse5 5) 0)) (not (= (mod .cse6 29) 0)) (<= (mod .cse7 29) .cse8) (= (mod .cse9 10) 0) (not (= (mod (+ .cse6 1) 29) 0)) (< .cse7 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse12 (+ (div .cse10 10) 1))) (let ((.cse11 (div .cse12 5))) (and (not (= (mod .cse10 10) 0)) (= (mod (+ .cse11 1) 29) 0) (<= (mod .cse11 29) .cse8) (= (mod .cse12 5) 0) (< (+ (div .cse10 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse15 (* 9 v_~a29~0_899))) (let ((.cse13 (div .cse15 10))) (let ((.cse14 (div (+ .cse13 1) 5))) (and (= (mod .cse13 5) 0) (= (mod .cse14 29) 0) (<= (mod (div .cse15 50) 29) .cse2) (= (mod .cse15 10) 0) (<= 0 (+ .cse14 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse18 (* 9 v_~a29~0_899))) (let ((.cse16 (div .cse18 10))) (let ((.cse17 (div (+ .cse16 1) 5))) (and (= (mod .cse16 5) 0) (= (mod .cse17 29) 0) (<= (mod (div .cse18 50) 29) .cse2) (<= 0 (+ .cse17 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse20 (* 9 v_~a29~0_899))) (let ((.cse19 (+ (div .cse20 10) 1))) (and (<= (mod (div .cse19 5) 29) .cse2) (< .cse20 0) (= (mod .cse19 5) 0) (not (< (+ (div .cse20 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse21 (* 9 v_~a29~0_899))) (let ((.cse23 (div .cse21 50))) (let ((.cse22 (mod .cse23 29))) (and (= (mod (div (+ (div .cse21 10) 1) 5) 29) 0) (<= .cse22 .cse2) (= 0 .cse22) (= (mod .cse21 10) 0) (not (< (+ .cse23 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse25 (div (* 9 v_~a29~0_899) 50))) (let ((.cse24 (mod .cse25 29))) (and (<= .cse24 .cse2) (= 0 .cse24) (not (< (+ .cse25 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse28 (* 9 v_~a29~0_899))) (let ((.cse26 (div .cse28 50)) (.cse27 (div (+ (div .cse28 10) 1) 5))) (and (= (mod (+ .cse26 1) 29) 0) (<= (mod .cse26 29) .cse2) (= (mod (+ .cse27 1) 29) 0) (= (mod .cse28 10) 0) (not (< .cse27 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse31 (* 9 v_~a29~0_899))) (let ((.cse29 (div .cse31 50))) (let ((.cse30 (mod (+ .cse29 1) 29))) (and (not (= 0 (mod .cse29 29))) (not (= .cse30 0)) (= (mod (div (+ (div .cse31 10) 1) 5) 29) 0) (<= .cse30 .cse8) (= (mod .cse31 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse35 (* 9 v_~a29~0_899))) (let ((.cse32 (div .cse35 10))) (let ((.cse33 (div .cse35 50)) (.cse34 (div (+ .cse32 1) 5))) (and (= (mod .cse32 5) 0) (= (mod (+ .cse33 1) 29) 0) (= (mod (+ .cse34 1) 29) 0) (<= (mod .cse33 29) .cse8) (= (mod .cse35 10) 0) (< .cse34 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse38 (* 9 v_~a29~0_899))) (let ((.cse36 (div .cse38 50)) (.cse37 (div (+ (div .cse38 10) 1) 5))) (and (= (mod (+ .cse36 1) 29) 0) (<= (mod .cse36 29) .cse2) (= (mod (+ .cse37 1) 29) 0) (not (< .cse37 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse40 (* 9 v_~a29~0_899))) (let ((.cse39 (div (+ (div .cse40 10) 1) 5))) (and (= (mod .cse39 29) 0) (<= (mod (div .cse40 50) 29) .cse2) (= (mod .cse40 10) 0) (<= 0 (+ .cse39 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse42 (* 9 v_~a29~0_899))) (let ((.cse41 (div .cse42 50))) (and (= (mod (+ .cse41 1) 29) 0) (<= (mod .cse41 29) .cse2) (not (< (div .cse42 10) 0)) (= (mod .cse42 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse44 (* 9 v_~a29~0_899))) (let ((.cse46 (+ (div .cse44 10) 1))) (let ((.cse45 (div .cse46 5))) (let ((.cse43 (mod .cse45 29))) (and (= .cse43 0) (= (mod (+ (div .cse44 50) 1) 29) 0) (not (= (mod .cse44 10) 0)) (< (+ .cse45 1) 0) (<= .cse43 .cse2) (= (mod .cse46 5) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse49 (* 9 v_~a29~0_899))) (let ((.cse48 (div .cse49 50)) (.cse47 (div .cse49 10))) (and (= (mod (div (+ .cse47 1) 5) 29) 0) (= (mod (+ .cse48 1) 29) 0) (<= (mod .cse48 29) .cse2) (not (< .cse47 0)) (= (mod .cse49 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse50 (* 9 v_~a29~0_899))) (let ((.cse52 (div .cse50 50))) (let ((.cse51 (mod .cse52 29))) (and (= (mod (div (+ (div .cse50 10) 1) 5) 29) 0) (<= .cse51 .cse2) (= 0 .cse51) (not (< (+ .cse52 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse53 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse55 (div .cse53 5))) (let ((.cse54 (+ .cse55 1))) (and (not (= (mod .cse53 5) 0)) (not (< .cse54 0)) (< .cse55 0) (<= (mod .cse54 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse57 (* 9 v_~a29~0_899))) (let ((.cse56 (div (+ (div .cse57 10) 1) 5)) (.cse58 (div .cse57 50))) (and (= (mod .cse56 29) 0) (not (= (mod .cse57 10) 0)) (<= (mod (+ .cse56 1) 29) .cse8) (= 0 (mod .cse58 29)) (< (+ .cse58 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse59 (* 9 v_~a29~0_899))) (let ((.cse60 (div .cse59 50))) (and (= (mod (div .cse59 10) 5) 0) (<= (mod .cse60 29) .cse2) (<= 0 .cse60) (= (mod .cse59 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse61 (* 9 v_~a29~0_899))) (let ((.cse62 (div .cse61 50))) (and (= (mod (div .cse61 10) 5) 0) (= (mod (+ .cse62 1) 29) 0) (<= (mod .cse62 29) .cse2) (not (< .cse62 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse63 (* 9 v_~a29~0_899))) (let ((.cse64 (+ (div .cse63 10) 1)) (.cse65 (div .cse63 50))) (and (not (= (mod .cse63 10) 0)) (<= (mod (div .cse64 5) 29) .cse8) (= 0 (mod .cse65 29)) (= (mod .cse64 5) 0) (< (+ .cse65 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse67 (* 9 v_~a29~0_899))) (let ((.cse66 (div .cse67 50))) (and (<= (mod .cse66 29) .cse2) (= (mod (+ (div (+ (div .cse67 10) 1) 5) 1) 29) 0) (<= 0 .cse66))))) (exists ((v_~a29~0_899 Int)) (let ((.cse69 (* 9 v_~a29~0_899))) (let ((.cse68 (div .cse69 50))) (and (<= (mod .cse68 29) .cse2) (= (mod (+ (div (+ (div .cse69 10) 1) 5) 1) 29) 0) (<= 0 .cse68) (= (mod .cse69 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse70 (* 9 v_~a29~0_899))) (let ((.cse72 (div (+ (div .cse70 10) 1) 5))) (let ((.cse71 (mod (+ .cse72 1) 29))) (and (= (mod (+ (div .cse70 50) 1) 29) 0) (not (= (mod .cse70 10) 0)) (= .cse71 0) (< .cse72 0) (<= .cse71 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse74 (* 9 v_~a29~0_899))) (let ((.cse73 (div .cse74 50))) (and (= (mod (+ .cse73 1) 29) 0) (<= (mod .cse73 29) .cse2) (not (< (div .cse74 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse77 (* 9 v_~a29~0_899))) (let ((.cse75 (div .cse77 10)) (.cse76 (div .cse77 50))) (and (= (mod .cse75 5) 0) (<= (mod .cse76 29) .cse2) (= (mod (+ (div (+ .cse75 1) 5) 1) 29) 0) (<= 0 .cse76))))) (exists ((v_~a29~0_899 Int)) (let ((.cse78 (* 9 v_~a29~0_899))) (let ((.cse79 (div .cse78 50))) (and (= (mod (div (+ (div .cse78 10) 1) 5) 29) 0) (<= (mod .cse79 29) .cse2) (<= 0 .cse79))))) (exists ((v_~a29~0_899 Int)) (let ((.cse82 (* 9 v_~a29~0_899))) (let ((.cse80 (div .cse82 50)) (.cse81 (div (+ (div .cse82 10) 1) 5))) (and (not (= 0 (mod .cse80 29))) (not (= (mod (+ .cse80 1) 29) 0)) (= (mod .cse81 29) 0) (not (= (mod .cse82 10) 0)) (<= (mod (+ .cse81 1) 29) .cse8))))) (exists ((v_~a29~0_899 Int)) (let ((.cse83 (* 9 v_~a29~0_899))) (let ((.cse85 (div .cse83 50))) (let ((.cse84 (mod .cse85 29))) (and (= (mod (div .cse83 10) 5) 0) (<= .cse84 .cse2) (= 0 .cse84) (not (< (+ .cse85 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse87 (* 9 v_~a29~0_899))) (let ((.cse86 (div (+ (div .cse87 10) 1) 5))) (and (<= 0 .cse86) (<= (mod .cse86 29) .cse2) (< .cse87 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse90 (* 9 v_~a29~0_899))) (let ((.cse88 (div .cse90 10)) (.cse89 (mod (+ (div .cse90 50) 1) 29))) (and (= (mod (div (+ .cse88 1) 5) 29) 0) (= .cse89 0) (= (mod .cse90 10) 0) (< .cse88 0) (<= .cse89 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse92 (* 9 v_~a29~0_899))) (let ((.cse91 (mod (div (+ (div .cse92 10) 1) 5) 29))) (and (= .cse91 0) (<= .cse91 .cse2) (< .cse92 0) (not (< (+ (div .cse92 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse93 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse93 29) .cse2) (<= 0 .cse93)))) (exists ((v_~a29~0_899 Int)) (let ((.cse94 (* 9 v_~a29~0_899))) (and (= (mod (+ (div (+ (div .cse94 10) 1) 5) 1) 29) 0) (= 0 (mod (div .cse94 50) 29))))) (exists ((v_~a29~0_899 Int)) (let ((.cse98 (* 9 v_~a29~0_899))) (let ((.cse95 (div .cse98 50))) (let ((.cse99 (+ .cse95 1))) (let ((.cse97 (div .cse98 10)) (.cse96 (mod .cse99 29))) (and (not (= 0 (mod .cse95 29))) (not (= .cse96 0)) (not (= (mod .cse97 5) 0)) (= (mod (+ (div (+ .cse97 1) 5) 1) 29) 0) (<= .cse96 .cse8) (= (mod .cse98 10) 0) (< .cse99 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse103 (* 9 v_~a29~0_899))) (let ((.cse101 (div .cse103 10))) (let ((.cse102 (div (+ .cse101 1) 5)) (.cse100 (mod (+ (div .cse103 50) 1) 29))) (and (= .cse100 0) (not (= (mod .cse101 5) 0)) (= (mod (+ .cse102 1) 29) 0) (= (mod .cse103 10) 0) (< .cse102 0) (<= .cse100 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse104 (* 9 v_~a29~0_899))) (let ((.cse106 (div .cse104 50))) (let ((.cse105 (mod .cse106 29))) (and (= (mod (div .cse104 10) 5) 0) (<= .cse105 .cse2) (= 0 .cse105) (= (mod .cse104 10) 0) (< (+ .cse106 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse110 (* 9 v_~a29~0_899))) (let ((.cse108 (div .cse110 50))) (let ((.cse107 (div .cse110 10)) (.cse109 (+ .cse108 1))) (and (= (mod (div (+ .cse107 1) 5) 29) 0) (not (= (mod .cse107 5) 0)) (= 0 (mod .cse108 29)) (<= (mod .cse109 29) .cse8) (= (mod .cse110 10) 0) (< .cse109 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse112 (* 9 v_~a29~0_899))) (let ((.cse113 (div .cse112 50))) (let ((.cse111 (mod .cse113 29))) (and (<= .cse111 .cse2) (= 0 .cse111) (= (mod .cse112 10) 0) (not (< (+ .cse113 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse114 (* 9 v_~a29~0_899))) (let ((.cse115 (div .cse114 50))) (let ((.cse116 (+ .cse115 1))) (and (not (= (mod (div (+ (div .cse114 10) 1) 5) 29) 0)) (= 0 (mod .cse115 29)) (<= (mod .cse116 29) .cse8) (= (mod .cse114 10) 0) (< .cse116 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse117 (* 9 v_~a29~0_899))) (let ((.cse118 (div .cse117 50))) (and (= (mod (div .cse117 10) 5) 0) (= (mod (+ .cse118 1) 29) 0) (<= (mod .cse118 29) .cse2) (not (< .cse118 0)) (= (mod .cse117 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse122 (* 9 v_~a29~0_899))) (let ((.cse121 (div .cse122 50))) (let ((.cse119 (div .cse122 10)) (.cse120 (+ .cse121 1))) (and (= (mod .cse119 5) 0) (not (= (mod .cse120 29) 0)) (not (= (mod (div (+ .cse119 1) 5) 29) 0)) (<= (mod .cse121 29) .cse8) (= (mod .cse122 10) 0) (< .cse120 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse125 (* 9 v_~a29~0_899))) (let ((.cse124 (div (+ (div .cse125 10) 1) 5))) (let ((.cse123 (mod .cse124 29))) (and (= .cse123 0) (not (< (+ .cse124 1) 0)) (<= .cse123 .cse2) (< .cse125 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse127 (* 9 v_~a29~0_899))) (let ((.cse126 (div (+ (div .cse127 10) 1) 5))) (and (< .cse126 0) (<= (mod (+ .cse126 1) 29) .cse2) (not (< (+ (div .cse127 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse129 (* 9 v_~a29~0_899))) (let ((.cse128 (div (+ (div .cse129 10) 1) 5))) (and (not (< (+ .cse128 1) 0)) (<= (mod .cse128 29) .cse8) (< (+ (div .cse129 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse132 (* 9 v_~a29~0_899))) (let ((.cse130 (div .cse132 50)) (.cse133 (+ (div .cse132 10) 1))) (let ((.cse134 (mod (+ (div .cse133 5) 1) 29)) (.cse131 (+ .cse130 1))) (and (not (= 0 (mod .cse130 29))) (not (= (mod .cse131 29) 0)) (not (= (mod .cse132 10) 0)) (not (= (mod .cse133 5) 0)) (= .cse134 0) (<= .cse134 .cse2) (< .cse131 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse137 (* 9 v_~a29~0_899))) (let ((.cse136 (div .cse137 50)) (.cse135 (div .cse137 10))) (and (= (mod (div (+ .cse135 1) 5) 29) 0) (= (mod (+ .cse136 1) 29) 0) (<= (mod .cse136 29) .cse2) (not (< .cse135 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse138 (* 9 v_~a29~0_899))) (let ((.cse139 (+ (div .cse138 10) 1))) (let ((.cse140 (div .cse139 5))) (let ((.cse141 (mod (+ .cse140 1) 29)) (.cse142 (div .cse138 50))) (and (not (= (mod .cse138 10) 0)) (not (= (mod .cse139 5) 0)) (not (= (mod .cse140 29) 0)) (<= .cse141 .cse8) (= 0 (mod .cse142 29)) (not (= .cse141 0)) (< (+ .cse142 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse144 (* 9 v_~a29~0_899))) (let ((.cse143 (div .cse144 10))) (let ((.cse145 (div (+ .cse143 1) 5))) (and (= (mod .cse143 5) 0) (<= (mod (div .cse144 50) 29) .cse2) (= (mod (+ .cse145 1) 29) 0) (= (mod .cse144 10) 0) (not (< .cse145 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse148 (* 9 v_~a29~0_899))) (let ((.cse147 (div .cse148 50)) (.cse146 (div .cse148 10))) (and (= (mod .cse146 5) 0) (= (mod (+ .cse147 1) 29) 0) (<= (mod .cse147 29) .cse2) (not (< (div (+ .cse146 1) 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse151 (* 9 v_~a29~0_899))) (let ((.cse149 (div .cse151 10)) (.cse150 (div .cse151 50))) (and (= (mod .cse149 5) 0) (<= (mod .cse150 29) .cse2) (= (mod (+ (div (+ .cse149 1) 5) 1) 29) 0) (<= 0 .cse150) (= (mod .cse151 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse154 (* 9 v_~a29~0_899))) (let ((.cse157 (+ (div .cse154 10) 1))) (let ((.cse152 (div .cse154 50)) (.cse156 (div .cse157 5))) (let ((.cse155 (mod .cse156 29)) (.cse153 (+ .cse152 1))) (and (not (= 0 (mod .cse152 29))) (not (= (mod .cse153 29) 0)) (not (= (mod .cse154 10) 0)) (not (= .cse155 0)) (<= .cse155 .cse8) (not (= (mod (+ .cse156 1) 29) 0)) (= (mod .cse157 5) 0) (< .cse153 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse159 (* 9 v_~a29~0_899))) (let ((.cse158 (+ (div .cse159 10) 1))) (and (not (< .cse158 0)) (<= (mod (div .cse158 5) 29) .cse2) (< .cse159 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse160 (* 9 v_~a29~0_899))) (let ((.cse162 (div .cse160 50))) (let ((.cse161 (mod .cse162 29))) (and (= (mod (div .cse160 10) 5) 0) (<= .cse161 .cse2) (= 0 .cse161) (= (mod .cse160 10) 0) (not (< (+ .cse162 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse164 (* 9 v_~a29~0_899))) (let ((.cse163 (div .cse164 50))) (and (<= (mod .cse163 29) .cse2) (<= 0 .cse163) (= (mod .cse164 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse167 (* 9 v_~a29~0_899))) (let ((.cse168 (+ (div .cse167 10) 1))) (let ((.cse165 (div .cse167 50)) (.cse169 (div .cse168 5))) (let ((.cse170 (mod (+ .cse169 1) 29)) (.cse166 (+ .cse165 1))) (and (not (= 0 (mod .cse165 29))) (not (= (mod .cse166 29) 0)) (not (= (mod .cse167 10) 0)) (not (= (mod .cse168 5) 0)) (not (= (mod .cse169 29) 0)) (<= .cse170 .cse8) (not (= .cse170 0)) (< .cse166 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse171 (* 9 v_~a29~0_899))) (let ((.cse172 (div .cse171 50))) (and (= (mod (div .cse171 10) 5) 0) (<= (mod .cse172 29) .cse2) (<= 0 .cse172))))))) is different from true [2022-11-20 11:07:51,455 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 42 c_~a29~0)) (.cse2 (+ c_~a29~0 13))) (or (exists ((v_~a29~0_899 Int)) (let ((.cse0 (* 9 v_~a29~0_899))) (let ((.cse3 (+ (div .cse0 10) 1))) (let ((.cse1 (div .cse3 5))) (and (= (mod (+ (div .cse0 50) 1) 29) 0) (not (< (+ .cse1 1) 0)) (<= (mod .cse1 29) .cse2) (< .cse0 0) (= (mod .cse3 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse9 (* 9 v_~a29~0_899))) (let ((.cse4 (div .cse9 50)) (.cse5 (div .cse9 10))) (let ((.cse6 (div (+ .cse5 1) 5)) (.cse7 (+ .cse4 1))) (and (not (= 0 (mod .cse4 29))) (not (= (mod .cse5 5) 0)) (not (= (mod .cse6 29) 0)) (<= (mod .cse7 29) .cse8) (= (mod .cse9 10) 0) (not (= (mod (+ .cse6 1) 29) 0)) (< .cse7 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse12 (+ (div .cse10 10) 1))) (let ((.cse11 (div .cse12 5))) (and (not (= (mod .cse10 10) 0)) (= (mod (+ .cse11 1) 29) 0) (<= (mod .cse11 29) .cse8) (= (mod .cse12 5) 0) (< (+ (div .cse10 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse15 (* 9 v_~a29~0_899))) (let ((.cse13 (div .cse15 10))) (let ((.cse14 (div (+ .cse13 1) 5))) (and (= (mod .cse13 5) 0) (= (mod .cse14 29) 0) (<= (mod (div .cse15 50) 29) .cse2) (= (mod .cse15 10) 0) (<= 0 (+ .cse14 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse18 (* 9 v_~a29~0_899))) (let ((.cse16 (div .cse18 10))) (let ((.cse17 (div (+ .cse16 1) 5))) (and (= (mod .cse16 5) 0) (= (mod .cse17 29) 0) (<= (mod (div .cse18 50) 29) .cse2) (<= 0 (+ .cse17 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse20 (* 9 v_~a29~0_899))) (let ((.cse19 (+ (div .cse20 10) 1))) (and (<= (mod (div .cse19 5) 29) .cse2) (< .cse20 0) (= (mod .cse19 5) 0) (not (< (+ (div .cse20 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse21 (* 9 v_~a29~0_899))) (let ((.cse23 (div .cse21 50))) (let ((.cse22 (mod .cse23 29))) (and (= (mod (div (+ (div .cse21 10) 1) 5) 29) 0) (<= .cse22 .cse2) (= 0 .cse22) (= (mod .cse21 10) 0) (not (< (+ .cse23 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse25 (div (* 9 v_~a29~0_899) 50))) (let ((.cse24 (mod .cse25 29))) (and (<= .cse24 .cse2) (= 0 .cse24) (not (< (+ .cse25 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse28 (* 9 v_~a29~0_899))) (let ((.cse26 (div .cse28 50)) (.cse27 (div (+ (div .cse28 10) 1) 5))) (and (= (mod (+ .cse26 1) 29) 0) (<= (mod .cse26 29) .cse2) (= (mod (+ .cse27 1) 29) 0) (= (mod .cse28 10) 0) (not (< .cse27 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse31 (* 9 v_~a29~0_899))) (let ((.cse29 (div .cse31 50))) (let ((.cse30 (mod (+ .cse29 1) 29))) (and (not (= 0 (mod .cse29 29))) (not (= .cse30 0)) (= (mod (div (+ (div .cse31 10) 1) 5) 29) 0) (<= .cse30 .cse8) (= (mod .cse31 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse34 (* 9 v_~a29~0_899))) (let ((.cse32 (div .cse34 50)) (.cse33 (div (+ (div .cse34 10) 1) 5))) (and (= (mod (+ .cse32 1) 29) 0) (<= (mod .cse32 29) .cse2) (= (mod (+ .cse33 1) 29) 0) (not (< .cse33 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse36 (* 9 v_~a29~0_899))) (let ((.cse35 (div (+ (div .cse36 10) 1) 5))) (and (= (mod .cse35 29) 0) (<= (mod (div .cse36 50) 29) .cse2) (= (mod .cse36 10) 0) (<= 0 (+ .cse35 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse38 (* 9 v_~a29~0_899))) (let ((.cse37 (div .cse38 50))) (and (= (mod (+ .cse37 1) 29) 0) (<= (mod .cse37 29) .cse2) (not (< (div .cse38 10) 0)) (= (mod .cse38 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse40 (* 9 v_~a29~0_899))) (let ((.cse42 (+ (div .cse40 10) 1))) (let ((.cse41 (div .cse42 5))) (let ((.cse39 (mod .cse41 29))) (and (= .cse39 0) (= (mod (+ (div .cse40 50) 1) 29) 0) (not (= (mod .cse40 10) 0)) (< (+ .cse41 1) 0) (<= .cse39 .cse2) (= (mod .cse42 5) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse45 (* 9 v_~a29~0_899))) (let ((.cse44 (div .cse45 50)) (.cse43 (div .cse45 10))) (and (= (mod (div (+ .cse43 1) 5) 29) 0) (= (mod (+ .cse44 1) 29) 0) (<= (mod .cse44 29) .cse2) (not (< .cse43 0)) (= (mod .cse45 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse46 (* 9 v_~a29~0_899))) (let ((.cse48 (div .cse46 50))) (let ((.cse47 (mod .cse48 29))) (and (= (mod (div (+ (div .cse46 10) 1) 5) 29) 0) (<= .cse47 .cse2) (= 0 .cse47) (not (< (+ .cse48 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse49 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse51 (div .cse49 5))) (let ((.cse50 (+ .cse51 1))) (and (not (= (mod .cse49 5) 0)) (not (< .cse50 0)) (< .cse51 0) (<= (mod .cse50 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse54 (* 9 v_~a29~0_899))) (let ((.cse52 (div .cse54 10))) (let ((.cse53 (div (+ .cse52 1) 5))) (and (= (mod .cse52 5) 0) (= (mod (+ .cse53 1) 29) 0) (<= (mod (div .cse54 50) 29) .cse8) (= (mod .cse54 10) 0) (< .cse53 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse56 (* 9 v_~a29~0_899))) (let ((.cse55 (div (+ (div .cse56 10) 1) 5)) (.cse57 (div .cse56 50))) (and (= (mod .cse55 29) 0) (not (= (mod .cse56 10) 0)) (<= (mod (+ .cse55 1) 29) .cse8) (= 0 (mod .cse57 29)) (< (+ .cse57 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse60 (* 9 v_~a29~0_899))) (let ((.cse58 (div .cse60 50))) (let ((.cse61 (+ .cse58 1))) (let ((.cse59 (mod .cse61 29))) (and (not (= 0 (mod .cse58 29))) (not (= .cse59 0)) (= (mod (+ (div (+ (div .cse60 10) 1) 5) 1) 29) 0) (<= .cse59 .cse8) (= (mod .cse60 10) 0) (< .cse61 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse62 (* 9 v_~a29~0_899))) (let ((.cse63 (div .cse62 50))) (and (= (mod (div .cse62 10) 5) 0) (<= (mod .cse63 29) .cse2) (<= 0 .cse63) (= (mod .cse62 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse64 (* 9 v_~a29~0_899))) (let ((.cse65 (div .cse64 50))) (and (= (mod (div .cse64 10) 5) 0) (= (mod (+ .cse65 1) 29) 0) (<= (mod .cse65 29) .cse2) (not (< .cse65 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse66 (* 9 v_~a29~0_899))) (let ((.cse67 (+ (div .cse66 10) 1)) (.cse68 (div .cse66 50))) (and (not (= (mod .cse66 10) 0)) (<= (mod (div .cse67 5) 29) .cse8) (= 0 (mod .cse68 29)) (= (mod .cse67 5) 0) (< (+ .cse68 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse70 (* 9 v_~a29~0_899))) (let ((.cse69 (div .cse70 50))) (and (<= (mod .cse69 29) .cse2) (= (mod (+ (div (+ (div .cse70 10) 1) 5) 1) 29) 0) (<= 0 .cse69))))) (exists ((v_~a29~0_899 Int)) (let ((.cse72 (* 9 v_~a29~0_899))) (let ((.cse71 (div .cse72 50))) (and (<= (mod .cse71 29) .cse2) (= (mod (+ (div (+ (div .cse72 10) 1) 5) 1) 29) 0) (<= 0 .cse71) (= (mod .cse72 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse73 (* 9 v_~a29~0_899))) (let ((.cse75 (div (+ (div .cse73 10) 1) 5))) (let ((.cse74 (mod (+ .cse75 1) 29))) (and (= (mod (+ (div .cse73 50) 1) 29) 0) (not (= (mod .cse73 10) 0)) (= .cse74 0) (< .cse75 0) (<= .cse74 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse77 (* 9 v_~a29~0_899))) (let ((.cse76 (div .cse77 50))) (and (= (mod (+ .cse76 1) 29) 0) (<= (mod .cse76 29) .cse2) (not (< (div .cse77 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse80 (* 9 v_~a29~0_899))) (let ((.cse78 (div .cse80 10)) (.cse79 (div .cse80 50))) (and (= (mod .cse78 5) 0) (<= (mod .cse79 29) .cse2) (= (mod (+ (div (+ .cse78 1) 5) 1) 29) 0) (<= 0 .cse79))))) (exists ((v_~a29~0_899 Int)) (let ((.cse82 (* 9 v_~a29~0_899))) (let ((.cse85 (+ (div .cse82 10) 1))) (let ((.cse84 (div .cse85 5))) (let ((.cse83 (mod .cse84 29)) (.cse81 (div .cse82 50))) (and (not (= 0 (mod .cse81 29))) (not (= (mod .cse82 10) 0)) (not (= .cse83 0)) (<= .cse83 .cse8) (not (= (mod (+ .cse84 1) 29) 0)) (= (mod .cse85 5) 0) (< (+ .cse81 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse86 (* 9 v_~a29~0_899))) (let ((.cse87 (div .cse86 50))) (and (= (mod (div (+ (div .cse86 10) 1) 5) 29) 0) (<= (mod .cse87 29) .cse2) (<= 0 .cse87))))) (exists ((v_~a29~0_899 Int)) (let ((.cse90 (* 9 v_~a29~0_899))) (let ((.cse88 (div .cse90 50)) (.cse89 (div (+ (div .cse90 10) 1) 5))) (and (not (= 0 (mod .cse88 29))) (not (= (mod (+ .cse88 1) 29) 0)) (= (mod .cse89 29) 0) (not (= (mod .cse90 10) 0)) (<= (mod (+ .cse89 1) 29) .cse8))))) (exists ((v_~a29~0_899 Int)) (let ((.cse91 (* 9 v_~a29~0_899))) (let ((.cse93 (div .cse91 50))) (let ((.cse92 (mod .cse93 29))) (and (= (mod (div .cse91 10) 5) 0) (<= .cse92 .cse2) (= 0 .cse92) (not (< (+ .cse93 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse95 (* 9 v_~a29~0_899))) (let ((.cse94 (div (+ (div .cse95 10) 1) 5))) (and (<= 0 .cse94) (<= (mod .cse94 29) .cse2) (< .cse95 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse98 (* 9 v_~a29~0_899))) (let ((.cse96 (div .cse98 10)) (.cse97 (mod (+ (div .cse98 50) 1) 29))) (and (= (mod (div (+ .cse96 1) 5) 29) 0) (= .cse97 0) (= (mod .cse98 10) 0) (< .cse96 0) (<= .cse97 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse100 (* 9 v_~a29~0_899))) (let ((.cse99 (mod (div (+ (div .cse100 10) 1) 5) 29))) (and (= .cse99 0) (<= .cse99 .cse2) (< .cse100 0) (not (< (+ (div .cse100 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse101 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse101 29) .cse2) (<= 0 .cse101)))) (exists ((v_~a29~0_899 Int)) (let ((.cse105 (* 9 v_~a29~0_899))) (let ((.cse103 (div .cse105 10))) (let ((.cse104 (div (+ .cse103 1) 5)) (.cse102 (mod (+ (div .cse105 50) 1) 29))) (and (= .cse102 0) (not (= (mod .cse103 5) 0)) (= (mod (+ .cse104 1) 29) 0) (= (mod .cse105 10) 0) (< .cse104 0) (<= .cse102 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse106 (* 9 v_~a29~0_899))) (let ((.cse108 (div .cse106 50))) (let ((.cse107 (mod .cse108 29))) (and (= (mod (div .cse106 10) 5) 0) (<= .cse107 .cse2) (= 0 .cse107) (= (mod .cse106 10) 0) (< (+ .cse108 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse111 (* 9 v_~a29~0_899))) (let ((.cse109 (div .cse111 50)) (.cse112 (+ (div .cse111 10) 1))) (let ((.cse113 (mod (+ (div .cse112 5) 1) 29)) (.cse110 (+ .cse109 1))) (and (not (= 0 (mod .cse109 29))) (not (= (mod .cse110 29) 0)) (not (= (mod .cse111 10) 0)) (not (= (mod .cse112 5) 0)) (<= .cse113 .cse8) (not (= .cse113 0)) (< .cse110 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse117 (* 9 v_~a29~0_899))) (let ((.cse115 (div .cse117 50))) (let ((.cse114 (div .cse117 10)) (.cse116 (+ .cse115 1))) (and (= (mod (div (+ .cse114 1) 5) 29) 0) (not (= (mod .cse114 5) 0)) (= 0 (mod .cse115 29)) (<= (mod .cse116 29) .cse8) (= (mod .cse117 10) 0) (< .cse116 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse119 (* 9 v_~a29~0_899))) (let ((.cse120 (div .cse119 50))) (let ((.cse118 (mod .cse120 29))) (and (<= .cse118 .cse2) (= 0 .cse118) (= (mod .cse119 10) 0) (not (< (+ .cse120 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse121 (* 9 v_~a29~0_899))) (let ((.cse122 (div .cse121 50))) (let ((.cse123 (+ .cse122 1))) (and (not (= (mod (div (+ (div .cse121 10) 1) 5) 29) 0)) (= 0 (mod .cse122 29)) (<= (mod .cse123 29) .cse8) (= (mod .cse121 10) 0) (< .cse123 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse124 (* 9 v_~a29~0_899))) (let ((.cse125 (div .cse124 50))) (and (= (mod (div .cse124 10) 5) 0) (= (mod (+ .cse125 1) 29) 0) (<= (mod .cse125 29) .cse2) (not (< .cse125 0)) (= (mod .cse124 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse129 (* 9 v_~a29~0_899))) (let ((.cse128 (div .cse129 50))) (let ((.cse126 (div .cse129 10)) (.cse127 (+ .cse128 1))) (and (= (mod .cse126 5) 0) (not (= (mod .cse127 29) 0)) (not (= (mod (div (+ .cse126 1) 5) 29) 0)) (<= (mod .cse128 29) .cse8) (= (mod .cse129 10) 0) (< .cse127 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse132 (* 9 v_~a29~0_899))) (let ((.cse131 (div (+ (div .cse132 10) 1) 5))) (let ((.cse130 (mod .cse131 29))) (and (= .cse130 0) (not (< (+ .cse131 1) 0)) (<= .cse130 .cse2) (< .cse132 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse134 (* 9 v_~a29~0_899))) (let ((.cse133 (div (+ (div .cse134 10) 1) 5))) (and (< .cse133 0) (<= (mod (+ .cse133 1) 29) .cse2) (not (< (+ (div .cse134 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse136 (* 9 v_~a29~0_899))) (let ((.cse135 (div (+ (div .cse136 10) 1) 5))) (and (not (< (+ .cse135 1) 0)) (<= (mod .cse135 29) .cse8) (< (+ (div .cse136 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse139 (* 9 v_~a29~0_899))) (let ((.cse137 (div .cse139 50)) (.cse140 (+ (div .cse139 10) 1))) (let ((.cse141 (mod (+ (div .cse140 5) 1) 29)) (.cse138 (+ .cse137 1))) (and (not (= 0 (mod .cse137 29))) (not (= (mod .cse138 29) 0)) (not (= (mod .cse139 10) 0)) (not (= (mod .cse140 5) 0)) (= .cse141 0) (<= .cse141 .cse2) (< .cse138 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse144 (* 9 v_~a29~0_899))) (let ((.cse143 (div .cse144 50)) (.cse142 (div .cse144 10))) (and (= (mod (div (+ .cse142 1) 5) 29) 0) (= (mod (+ .cse143 1) 29) 0) (<= (mod .cse143 29) .cse2) (not (< .cse142 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse146 (* 9 v_~a29~0_899))) (let ((.cse145 (div .cse146 10))) (let ((.cse147 (div (+ .cse145 1) 5))) (and (= (mod .cse145 5) 0) (<= (mod (div .cse146 50) 29) .cse2) (= (mod (+ .cse147 1) 29) 0) (= (mod .cse146 10) 0) (not (< .cse147 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse150 (* 9 v_~a29~0_899))) (let ((.cse149 (div .cse150 50)) (.cse148 (div .cse150 10))) (and (= (mod .cse148 5) 0) (= (mod (+ .cse149 1) 29) 0) (<= (mod .cse149 29) .cse2) (not (< (div (+ .cse148 1) 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse153 (* 9 v_~a29~0_899))) (let ((.cse151 (div .cse153 10)) (.cse152 (div .cse153 50))) (and (= (mod .cse151 5) 0) (<= (mod .cse152 29) .cse2) (= (mod (+ (div (+ .cse151 1) 5) 1) 29) 0) (<= 0 .cse152) (= (mod .cse153 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse155 (* 9 v_~a29~0_899))) (let ((.cse154 (+ (div .cse155 10) 1))) (and (not (< .cse154 0)) (<= (mod (div .cse154 5) 29) .cse2) (< .cse155 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse156 (* 9 v_~a29~0_899))) (let ((.cse158 (div .cse156 50))) (let ((.cse157 (mod .cse158 29))) (and (= (mod (div .cse156 10) 5) 0) (<= .cse157 .cse2) (= 0 .cse157) (= (mod .cse156 10) 0) (not (< (+ .cse158 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse160 (* 9 v_~a29~0_899))) (let ((.cse159 (div .cse160 50))) (and (<= (mod .cse159 29) .cse2) (<= 0 .cse159) (= (mod .cse160 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse161 (* 9 v_~a29~0_899))) (let ((.cse162 (div .cse161 50))) (and (= (mod (div .cse161 10) 5) 0) (<= (mod .cse162 29) .cse2) (<= 0 .cse162))))))) is different from true [2022-11-20 11:08:54,252 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 42 c_~a29~0)) (.cse2 (+ c_~a29~0 13))) (or (exists ((v_~a29~0_899 Int)) (let ((.cse0 (* 9 v_~a29~0_899))) (let ((.cse3 (+ (div .cse0 10) 1))) (let ((.cse1 (div .cse3 5))) (and (= (mod (+ (div .cse0 50) 1) 29) 0) (not (< (+ .cse1 1) 0)) (<= (mod .cse1 29) .cse2) (< .cse0 0) (= (mod .cse3 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse9 (* 9 v_~a29~0_899))) (let ((.cse4 (div .cse9 50)) (.cse5 (div .cse9 10))) (let ((.cse6 (div (+ .cse5 1) 5)) (.cse7 (+ .cse4 1))) (and (not (= 0 (mod .cse4 29))) (not (= (mod .cse5 5) 0)) (not (= (mod .cse6 29) 0)) (<= (mod .cse7 29) .cse8) (= (mod .cse9 10) 0) (not (= (mod (+ .cse6 1) 29) 0)) (< .cse7 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse12 (+ (div .cse10 10) 1))) (let ((.cse11 (div .cse12 5))) (and (not (= (mod .cse10 10) 0)) (= (mod (+ .cse11 1) 29) 0) (<= (mod .cse11 29) .cse8) (= (mod .cse12 5) 0) (< (+ (div .cse10 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse15 (* 9 v_~a29~0_899))) (let ((.cse13 (div .cse15 10))) (let ((.cse14 (div (+ .cse13 1) 5))) (and (= (mod .cse13 5) 0) (= (mod .cse14 29) 0) (<= (mod (div .cse15 50) 29) .cse2) (= (mod .cse15 10) 0) (<= 0 (+ .cse14 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse18 (* 9 v_~a29~0_899))) (let ((.cse16 (div .cse18 10))) (let ((.cse17 (div (+ .cse16 1) 5))) (and (= (mod .cse16 5) 0) (= (mod .cse17 29) 0) (<= (mod (div .cse18 50) 29) .cse2) (<= 0 (+ .cse17 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse20 (* 9 v_~a29~0_899))) (let ((.cse19 (+ (div .cse20 10) 1))) (and (<= (mod (div .cse19 5) 29) .cse2) (< .cse20 0) (= (mod .cse19 5) 0) (not (< (+ (div .cse20 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse21 (* 9 v_~a29~0_899))) (let ((.cse23 (div .cse21 50))) (let ((.cse22 (mod .cse23 29))) (and (= (mod (div (+ (div .cse21 10) 1) 5) 29) 0) (<= .cse22 .cse2) (= 0 .cse22) (= (mod .cse21 10) 0) (not (< (+ .cse23 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse25 (div (* 9 v_~a29~0_899) 50))) (let ((.cse24 (mod .cse25 29))) (and (<= .cse24 .cse2) (= 0 .cse24) (not (< (+ .cse25 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse28 (* 9 v_~a29~0_899))) (let ((.cse26 (div .cse28 50)) (.cse27 (div (+ (div .cse28 10) 1) 5))) (and (= (mod (+ .cse26 1) 29) 0) (<= (mod .cse26 29) .cse2) (= (mod (+ .cse27 1) 29) 0) (= (mod .cse28 10) 0) (not (< .cse27 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse31 (* 9 v_~a29~0_899))) (let ((.cse29 (div .cse31 50)) (.cse30 (div (+ (div .cse31 10) 1) 5))) (and (= (mod (+ .cse29 1) 29) 0) (<= (mod .cse29 29) .cse2) (= (mod (+ .cse30 1) 29) 0) (not (< .cse30 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse33 (* 9 v_~a29~0_899))) (let ((.cse32 (div (+ (div .cse33 10) 1) 5))) (and (= (mod .cse32 29) 0) (<= (mod (div .cse33 50) 29) .cse2) (= (mod .cse33 10) 0) (<= 0 (+ .cse32 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse35 (* 9 v_~a29~0_899))) (let ((.cse34 (div .cse35 50))) (and (= (mod (+ .cse34 1) 29) 0) (<= (mod .cse34 29) .cse2) (not (< (div .cse35 10) 0)) (= (mod .cse35 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse38 (* 9 v_~a29~0_899))) (let ((.cse37 (div .cse38 50)) (.cse36 (div .cse38 10))) (and (= (mod (div (+ .cse36 1) 5) 29) 0) (= (mod (+ .cse37 1) 29) 0) (<= (mod .cse37 29) .cse2) (not (< .cse36 0)) (= (mod .cse38 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse39 (* 9 v_~a29~0_899))) (let ((.cse41 (div .cse39 50))) (let ((.cse40 (mod .cse41 29))) (and (= (mod (div (+ (div .cse39 10) 1) 5) 29) 0) (<= .cse40 .cse2) (= 0 .cse40) (not (< (+ .cse41 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse42 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse44 (div .cse42 5))) (let ((.cse43 (+ .cse44 1))) (and (not (= (mod .cse42 5) 0)) (not (< .cse43 0)) (< .cse44 0) (<= (mod .cse43 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse46 (* 9 v_~a29~0_899))) (let ((.cse48 (+ (div .cse46 10) 1))) (let ((.cse47 (div .cse48 5))) (let ((.cse45 (mod .cse47 29))) (and (= .cse45 0) (not (= (mod .cse46 10) 0)) (< (+ .cse47 1) 0) (<= .cse45 .cse2) (= (mod .cse48 5) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse51 (* 9 v_~a29~0_899))) (let ((.cse49 (div .cse51 10))) (let ((.cse50 (div (+ .cse49 1) 5))) (and (= (mod .cse49 5) 0) (= (mod (+ .cse50 1) 29) 0) (<= (mod (div .cse51 50) 29) .cse8) (= (mod .cse51 10) 0) (< .cse50 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse53 (* 9 v_~a29~0_899))) (let ((.cse52 (div (+ (div .cse53 10) 1) 5)) (.cse54 (div .cse53 50))) (and (= (mod .cse52 29) 0) (not (= (mod .cse53 10) 0)) (<= (mod (+ .cse52 1) 29) .cse8) (= 0 (mod .cse54 29)) (< (+ .cse54 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse57 (* 9 v_~a29~0_899))) (let ((.cse55 (div .cse57 50))) (let ((.cse58 (+ .cse55 1))) (let ((.cse56 (mod .cse58 29))) (and (not (= 0 (mod .cse55 29))) (not (= .cse56 0)) (= (mod (+ (div (+ (div .cse57 10) 1) 5) 1) 29) 0) (<= .cse56 .cse8) (= (mod .cse57 10) 0) (< .cse58 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse59 (* 9 v_~a29~0_899))) (let ((.cse60 (div .cse59 50))) (and (= (mod (div .cse59 10) 5) 0) (<= (mod .cse60 29) .cse2) (<= 0 .cse60) (= (mod .cse59 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse61 (* 9 v_~a29~0_899))) (let ((.cse62 (div .cse61 50))) (and (= (mod (div .cse61 10) 5) 0) (= (mod (+ .cse62 1) 29) 0) (<= (mod .cse62 29) .cse2) (not (< .cse62 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse63 (* 9 v_~a29~0_899))) (let ((.cse64 (+ (div .cse63 10) 1)) (.cse65 (div .cse63 50))) (and (not (= (mod .cse63 10) 0)) (<= (mod (div .cse64 5) 29) .cse8) (= 0 (mod .cse65 29)) (= (mod .cse64 5) 0) (< (+ .cse65 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse67 (* 9 v_~a29~0_899))) (let ((.cse66 (div .cse67 50))) (and (<= (mod .cse66 29) .cse2) (= (mod (+ (div (+ (div .cse67 10) 1) 5) 1) 29) 0) (<= 0 .cse66))))) (exists ((v_~a29~0_899 Int)) (let ((.cse69 (* 9 v_~a29~0_899))) (let ((.cse68 (div .cse69 50))) (and (<= (mod .cse68 29) .cse2) (= (mod (+ (div (+ (div .cse69 10) 1) 5) 1) 29) 0) (<= 0 .cse68) (= (mod .cse69 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse70 (* 9 v_~a29~0_899))) (let ((.cse72 (div (+ (div .cse70 10) 1) 5))) (let ((.cse71 (mod (+ .cse72 1) 29))) (and (= (mod (+ (div .cse70 50) 1) 29) 0) (not (= (mod .cse70 10) 0)) (= .cse71 0) (< .cse72 0) (<= .cse71 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse74 (* 9 v_~a29~0_899))) (let ((.cse73 (div .cse74 50))) (and (= (mod (+ .cse73 1) 29) 0) (<= (mod .cse73 29) .cse2) (not (< (div .cse74 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse77 (* 9 v_~a29~0_899))) (let ((.cse75 (div .cse77 10)) (.cse76 (div .cse77 50))) (and (= (mod .cse75 5) 0) (<= (mod .cse76 29) .cse2) (= (mod (+ (div (+ .cse75 1) 5) 1) 29) 0) (<= 0 .cse76))))) (exists ((v_~a29~0_899 Int)) (let ((.cse79 (* 9 v_~a29~0_899))) (let ((.cse82 (+ (div .cse79 10) 1))) (let ((.cse81 (div .cse82 5))) (let ((.cse80 (mod .cse81 29)) (.cse78 (div .cse79 50))) (and (not (= 0 (mod .cse78 29))) (not (= (mod .cse79 10) 0)) (not (= .cse80 0)) (<= .cse80 .cse8) (not (= (mod (+ .cse81 1) 29) 0)) (= (mod .cse82 5) 0) (< (+ .cse78 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse83 (* 9 v_~a29~0_899))) (let ((.cse84 (div .cse83 50))) (and (= (mod (div (+ (div .cse83 10) 1) 5) 29) 0) (<= (mod .cse84 29) .cse2) (<= 0 .cse84))))) (exists ((v_~a29~0_899 Int)) (let ((.cse85 (* 9 v_~a29~0_899))) (let ((.cse87 (div .cse85 50))) (let ((.cse86 (mod .cse87 29))) (and (= (mod (div .cse85 10) 5) 0) (<= .cse86 .cse2) (= 0 .cse86) (not (< (+ .cse87 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse89 (* 9 v_~a29~0_899))) (let ((.cse88 (div (+ (div .cse89 10) 1) 5))) (and (<= 0 .cse88) (<= (mod .cse88 29) .cse2) (< .cse89 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse92 (* 9 v_~a29~0_899))) (let ((.cse90 (div .cse92 10)) (.cse91 (mod (+ (div .cse92 50) 1) 29))) (and (= (mod (div (+ .cse90 1) 5) 29) 0) (= .cse91 0) (= (mod .cse92 10) 0) (< .cse90 0) (<= .cse91 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse94 (* 9 v_~a29~0_899))) (let ((.cse93 (mod (div (+ (div .cse94 10) 1) 5) 29))) (and (= .cse93 0) (<= .cse93 .cse2) (< .cse94 0) (not (< (+ (div .cse94 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse95 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse95 29) .cse2) (<= 0 .cse95)))) (exists ((v_~a29~0_899 Int)) (let ((.cse99 (* 9 v_~a29~0_899))) (let ((.cse97 (div .cse99 10))) (let ((.cse98 (div (+ .cse97 1) 5)) (.cse96 (mod (+ (div .cse99 50) 1) 29))) (and (= .cse96 0) (not (= (mod .cse97 5) 0)) (= (mod (+ .cse98 1) 29) 0) (= (mod .cse99 10) 0) (< .cse98 0) (<= .cse96 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse100 (* 9 v_~a29~0_899))) (let ((.cse102 (div .cse100 50))) (let ((.cse101 (mod .cse102 29))) (and (= (mod (div .cse100 10) 5) 0) (<= .cse101 .cse2) (= 0 .cse101) (= (mod .cse100 10) 0) (< (+ .cse102 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse106 (* 9 v_~a29~0_899))) (let ((.cse104 (div .cse106 50))) (let ((.cse103 (div .cse106 10)) (.cse105 (+ .cse104 1))) (and (= (mod (div (+ .cse103 1) 5) 29) 0) (not (= (mod .cse103 5) 0)) (= 0 (mod .cse104 29)) (<= (mod .cse105 29) .cse8) (= (mod .cse106 10) 0) (< .cse105 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse108 (* 9 v_~a29~0_899))) (let ((.cse109 (div .cse108 50))) (let ((.cse107 (mod .cse109 29))) (and (<= .cse107 .cse2) (= 0 .cse107) (= (mod .cse108 10) 0) (not (< (+ .cse109 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse110 (* 9 v_~a29~0_899))) (let ((.cse111 (div .cse110 50))) (let ((.cse112 (+ .cse111 1))) (and (not (= (mod (div (+ (div .cse110 10) 1) 5) 29) 0)) (= 0 (mod .cse111 29)) (<= (mod .cse112 29) .cse8) (= (mod .cse110 10) 0) (< .cse112 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse115 (* 9 v_~a29~0_899))) (let ((.cse113 (div .cse115 50))) (let ((.cse116 (+ (div .cse115 10) 1)) (.cse114 (+ .cse113 1))) (and (not (= 0 (mod .cse113 29))) (not (= (mod .cse114 29) 0)) (not (= (mod .cse115 10) 0)) (not (= (mod .cse116 5) 0)) (<= (mod (+ (div .cse116 5) 1) 29) .cse8) (< .cse114 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse117 (* 9 v_~a29~0_899))) (let ((.cse118 (div .cse117 50))) (and (= (mod (div .cse117 10) 5) 0) (= (mod (+ .cse118 1) 29) 0) (<= (mod .cse118 29) .cse2) (not (< .cse118 0)) (= (mod .cse117 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse122 (* 9 v_~a29~0_899))) (let ((.cse121 (div .cse122 50))) (let ((.cse119 (div .cse122 10)) (.cse120 (+ .cse121 1))) (and (= (mod .cse119 5) 0) (not (= (mod .cse120 29) 0)) (not (= (mod (div (+ .cse119 1) 5) 29) 0)) (<= (mod .cse121 29) .cse8) (= (mod .cse122 10) 0) (< .cse120 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse125 (* 9 v_~a29~0_899))) (let ((.cse124 (div (+ (div .cse125 10) 1) 5))) (let ((.cse123 (mod .cse124 29))) (and (= .cse123 0) (not (< (+ .cse124 1) 0)) (<= .cse123 .cse2) (< .cse125 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse127 (* 9 v_~a29~0_899))) (let ((.cse126 (div (+ (div .cse127 10) 1) 5))) (and (< .cse126 0) (<= (mod (+ .cse126 1) 29) .cse2) (not (< (+ (div .cse127 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse129 (* 9 v_~a29~0_899))) (let ((.cse128 (div (+ (div .cse129 10) 1) 5))) (and (not (< (+ .cse128 1) 0)) (<= (mod .cse128 29) .cse8) (< (+ (div .cse129 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse132 (* 9 v_~a29~0_899))) (let ((.cse131 (div .cse132 50)) (.cse130 (div .cse132 10))) (and (= (mod (div (+ .cse130 1) 5) 29) 0) (= (mod (+ .cse131 1) 29) 0) (<= (mod .cse131 29) .cse2) (not (< .cse130 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse134 (* 9 v_~a29~0_899))) (let ((.cse133 (div .cse134 10))) (let ((.cse135 (div (+ .cse133 1) 5))) (and (= (mod .cse133 5) 0) (<= (mod (div .cse134 50) 29) .cse2) (= (mod (+ .cse135 1) 29) 0) (= (mod .cse134 10) 0) (not (< .cse135 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse138 (* 9 v_~a29~0_899))) (let ((.cse137 (div .cse138 50)) (.cse136 (div .cse138 10))) (and (= (mod .cse136 5) 0) (= (mod (+ .cse137 1) 29) 0) (<= (mod .cse137 29) .cse2) (not (< (div (+ .cse136 1) 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse141 (* 9 v_~a29~0_899))) (let ((.cse139 (div .cse141 10)) (.cse140 (div .cse141 50))) (and (= (mod .cse139 5) 0) (<= (mod .cse140 29) .cse2) (= (mod (+ (div (+ .cse139 1) 5) 1) 29) 0) (<= 0 .cse140) (= (mod .cse141 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse142 (+ (div .cse143 10) 1))) (and (not (< .cse142 0)) (<= (mod (div .cse142 5) 29) .cse2) (< .cse143 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse144 (* 9 v_~a29~0_899))) (let ((.cse146 (div .cse144 50))) (let ((.cse145 (mod .cse146 29))) (and (= (mod (div .cse144 10) 5) 0) (<= .cse145 .cse2) (= 0 .cse145) (= (mod .cse144 10) 0) (not (< (+ .cse146 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse148 (* 9 v_~a29~0_899))) (let ((.cse147 (div .cse148 50))) (and (<= (mod .cse147 29) .cse2) (<= 0 .cse147) (= (mod .cse148 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse149 (* 9 v_~a29~0_899))) (let ((.cse150 (div .cse149 50))) (and (= (mod (div .cse149 10) 5) 0) (<= (mod .cse150 29) .cse2) (<= 0 .cse150))))))) is different from true [2022-11-20 11:09:20,291 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 42 c_~a29~0)) (.cse2 (+ c_~a29~0 13))) (or (exists ((v_~a29~0_899 Int)) (let ((.cse0 (* 9 v_~a29~0_899))) (let ((.cse3 (+ (div .cse0 10) 1))) (let ((.cse1 (div .cse3 5))) (and (= (mod (+ (div .cse0 50) 1) 29) 0) (not (< (+ .cse1 1) 0)) (<= (mod .cse1 29) .cse2) (< .cse0 0) (= (mod .cse3 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse5 (* 9 v_~a29~0_899))) (let ((.cse7 (+ (div .cse5 50) 1))) (let ((.cse4 (mod .cse7 29))) (and (not (= .cse4 0)) (= (mod (+ (div (+ (div .cse5 10) 1) 5) 1) 29) 0) (<= .cse4 .cse6) (= (mod .cse5 10) 0) (< .cse7 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse12 (* 9 v_~a29~0_899))) (let ((.cse8 (div .cse12 50)) (.cse9 (div .cse12 10))) (let ((.cse10 (div (+ .cse9 1) 5)) (.cse11 (+ .cse8 1))) (and (not (= 0 (mod .cse8 29))) (not (= (mod .cse9 5) 0)) (not (= (mod .cse10 29) 0)) (<= (mod .cse11 29) .cse6) (= (mod .cse12 10) 0) (not (= (mod (+ .cse10 1) 29) 0)) (< .cse11 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse15 (+ (div .cse13 10) 1))) (let ((.cse14 (div .cse15 5))) (and (not (= (mod .cse13 10) 0)) (= (mod (+ .cse14 1) 29) 0) (<= (mod .cse14 29) .cse6) (= (mod .cse15 5) 0) (< (+ (div .cse13 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse18 (* 9 v_~a29~0_899))) (let ((.cse16 (div .cse18 10))) (let ((.cse17 (div (+ .cse16 1) 5))) (and (= (mod .cse16 5) 0) (= (mod .cse17 29) 0) (<= (mod (div .cse18 50) 29) .cse2) (= (mod .cse18 10) 0) (<= 0 (+ .cse17 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse21 (* 9 v_~a29~0_899))) (let ((.cse19 (div .cse21 10))) (let ((.cse20 (div (+ .cse19 1) 5))) (and (= (mod .cse19 5) 0) (= (mod .cse20 29) 0) (<= (mod (div .cse21 50) 29) .cse2) (<= 0 (+ .cse20 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse23 (* 9 v_~a29~0_899))) (let ((.cse22 (+ (div .cse23 10) 1))) (and (<= (mod (div .cse22 5) 29) .cse2) (< .cse23 0) (= (mod .cse22 5) 0) (not (< (+ (div .cse23 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse24 (* 9 v_~a29~0_899))) (let ((.cse26 (div .cse24 50))) (let ((.cse25 (mod .cse26 29))) (and (= (mod (div (+ (div .cse24 10) 1) 5) 29) 0) (<= .cse25 .cse2) (= 0 .cse25) (= (mod .cse24 10) 0) (not (< (+ .cse26 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse28 (div (* 9 v_~a29~0_899) 50))) (let ((.cse27 (mod .cse28 29))) (and (<= .cse27 .cse2) (= 0 .cse27) (not (< (+ .cse28 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse31 (* 9 v_~a29~0_899))) (let ((.cse29 (div .cse31 50)) (.cse30 (div (+ (div .cse31 10) 1) 5))) (and (= (mod (+ .cse29 1) 29) 0) (<= (mod .cse29 29) .cse2) (= (mod (+ .cse30 1) 29) 0) (= (mod .cse31 10) 0) (not (< .cse30 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse34 (* 9 v_~a29~0_899))) (let ((.cse32 (div .cse34 50)) (.cse33 (div (+ (div .cse34 10) 1) 5))) (and (= (mod (+ .cse32 1) 29) 0) (<= (mod .cse32 29) .cse2) (= (mod (+ .cse33 1) 29) 0) (not (< .cse33 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse36 (* 9 v_~a29~0_899))) (let ((.cse35 (div (+ (div .cse36 10) 1) 5))) (and (= (mod .cse35 29) 0) (<= (mod (div .cse36 50) 29) .cse2) (= (mod .cse36 10) 0) (<= 0 (+ .cse35 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse38 (* 9 v_~a29~0_899))) (let ((.cse37 (div .cse38 50))) (and (= (mod (+ .cse37 1) 29) 0) (<= (mod .cse37 29) .cse2) (not (< (div .cse38 10) 0)) (= (mod .cse38 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse41 (* 9 v_~a29~0_899))) (let ((.cse40 (div .cse41 50)) (.cse39 (div .cse41 10))) (and (= (mod (div (+ .cse39 1) 5) 29) 0) (= (mod (+ .cse40 1) 29) 0) (<= (mod .cse40 29) .cse2) (not (< .cse39 0)) (= (mod .cse41 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse42 (* 9 v_~a29~0_899))) (let ((.cse44 (div .cse42 50))) (let ((.cse43 (mod .cse44 29))) (and (= (mod (div (+ (div .cse42 10) 1) 5) 29) 0) (<= .cse43 .cse2) (= 0 .cse43) (not (< (+ .cse44 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse45 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse47 (div .cse45 5))) (let ((.cse46 (+ .cse47 1))) (and (not (= (mod .cse45 5) 0)) (not (< .cse46 0)) (< .cse47 0) (<= (mod .cse46 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse49 (* 9 v_~a29~0_899))) (let ((.cse51 (+ (div .cse49 10) 1))) (let ((.cse50 (div .cse51 5))) (let ((.cse48 (mod .cse50 29))) (and (= .cse48 0) (not (= (mod .cse49 10) 0)) (< (+ .cse50 1) 0) (<= .cse48 .cse2) (= (mod .cse51 5) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse54 (* 9 v_~a29~0_899))) (let ((.cse52 (div .cse54 10))) (let ((.cse53 (div (+ .cse52 1) 5))) (and (= (mod .cse52 5) 0) (= (mod (+ .cse53 1) 29) 0) (<= (mod (div .cse54 50) 29) .cse6) (= (mod .cse54 10) 0) (< .cse53 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse56 (* 9 v_~a29~0_899))) (let ((.cse55 (div (+ (div .cse56 10) 1) 5)) (.cse57 (div .cse56 50))) (and (= (mod .cse55 29) 0) (not (= (mod .cse56 10) 0)) (<= (mod (+ .cse55 1) 29) .cse6) (= 0 (mod .cse57 29)) (< (+ .cse57 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse58 (* 9 v_~a29~0_899))) (let ((.cse59 (div .cse58 50))) (and (= (mod (div .cse58 10) 5) 0) (<= (mod .cse59 29) .cse2) (<= 0 .cse59) (= (mod .cse58 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse60 (* 9 v_~a29~0_899))) (let ((.cse61 (div .cse60 50))) (and (= (mod (div .cse60 10) 5) 0) (= (mod (+ .cse61 1) 29) 0) (<= (mod .cse61 29) .cse2) (not (< .cse61 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse62 (* 9 v_~a29~0_899))) (let ((.cse63 (+ (div .cse62 10) 1)) (.cse64 (div .cse62 50))) (and (not (= (mod .cse62 10) 0)) (<= (mod (div .cse63 5) 29) .cse6) (= 0 (mod .cse64 29)) (= (mod .cse63 5) 0) (< (+ .cse64 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse66 (* 9 v_~a29~0_899))) (let ((.cse65 (div .cse66 50))) (and (<= (mod .cse65 29) .cse2) (= (mod (+ (div (+ (div .cse66 10) 1) 5) 1) 29) 0) (<= 0 .cse65))))) (exists ((v_~a29~0_899 Int)) (let ((.cse68 (* 9 v_~a29~0_899))) (let ((.cse67 (div .cse68 50))) (and (<= (mod .cse67 29) .cse2) (= (mod (+ (div (+ (div .cse68 10) 1) 5) 1) 29) 0) (<= 0 .cse67) (= (mod .cse68 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse69 (* 9 v_~a29~0_899))) (let ((.cse71 (div (+ (div .cse69 10) 1) 5))) (let ((.cse70 (mod (+ .cse71 1) 29))) (and (= (mod (+ (div .cse69 50) 1) 29) 0) (not (= (mod .cse69 10) 0)) (= .cse70 0) (< .cse71 0) (<= .cse70 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse73 (* 9 v_~a29~0_899))) (let ((.cse72 (div .cse73 50))) (and (= (mod (+ .cse72 1) 29) 0) (<= (mod .cse72 29) .cse2) (not (< (div .cse73 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse76 (* 9 v_~a29~0_899))) (let ((.cse74 (div .cse76 10)) (.cse75 (div .cse76 50))) (and (= (mod .cse74 5) 0) (<= (mod .cse75 29) .cse2) (= (mod (+ (div (+ .cse74 1) 5) 1) 29) 0) (<= 0 .cse75))))) (exists ((v_~a29~0_899 Int)) (let ((.cse78 (* 9 v_~a29~0_899))) (let ((.cse81 (+ (div .cse78 10) 1))) (let ((.cse80 (div .cse81 5))) (let ((.cse79 (mod .cse80 29)) (.cse77 (div .cse78 50))) (and (not (= 0 (mod .cse77 29))) (not (= (mod .cse78 10) 0)) (not (= .cse79 0)) (<= .cse79 .cse6) (not (= (mod (+ .cse80 1) 29) 0)) (= (mod .cse81 5) 0) (< (+ .cse77 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse82 (* 9 v_~a29~0_899))) (let ((.cse83 (div .cse82 50))) (and (= (mod (div (+ (div .cse82 10) 1) 5) 29) 0) (<= (mod .cse83 29) .cse2) (<= 0 .cse83))))) (exists ((v_~a29~0_899 Int)) (let ((.cse84 (* 9 v_~a29~0_899))) (let ((.cse86 (div .cse84 50))) (let ((.cse85 (mod .cse86 29))) (and (= (mod (div .cse84 10) 5) 0) (<= .cse85 .cse2) (= 0 .cse85) (not (< (+ .cse86 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse88 (* 9 v_~a29~0_899))) (let ((.cse87 (div (+ (div .cse88 10) 1) 5))) (and (<= 0 .cse87) (<= (mod .cse87 29) .cse2) (< .cse88 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse91 (* 9 v_~a29~0_899))) (let ((.cse89 (div .cse91 10)) (.cse90 (mod (+ (div .cse91 50) 1) 29))) (and (= (mod (div (+ .cse89 1) 5) 29) 0) (= .cse90 0) (= (mod .cse91 10) 0) (< .cse89 0) (<= .cse90 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse93 (* 9 v_~a29~0_899))) (let ((.cse92 (mod (div (+ (div .cse93 10) 1) 5) 29))) (and (= .cse92 0) (<= .cse92 .cse2) (< .cse93 0) (not (< (+ (div .cse93 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse94 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse94 29) .cse2) (<= 0 .cse94)))) (exists ((v_~a29~0_899 Int)) (let ((.cse98 (* 9 v_~a29~0_899))) (let ((.cse96 (div .cse98 10))) (let ((.cse97 (div (+ .cse96 1) 5)) (.cse95 (mod (+ (div .cse98 50) 1) 29))) (and (= .cse95 0) (not (= (mod .cse96 5) 0)) (= (mod (+ .cse97 1) 29) 0) (= (mod .cse98 10) 0) (< .cse97 0) (<= .cse95 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse99 (* 9 v_~a29~0_899))) (let ((.cse101 (div .cse99 50))) (let ((.cse100 (mod .cse101 29))) (and (= (mod (div .cse99 10) 5) 0) (<= .cse100 .cse2) (= 0 .cse100) (= (mod .cse99 10) 0) (< (+ .cse101 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse105 (* 9 v_~a29~0_899))) (let ((.cse103 (div .cse105 50))) (let ((.cse102 (div .cse105 10)) (.cse104 (+ .cse103 1))) (and (= (mod (div (+ .cse102 1) 5) 29) 0) (not (= (mod .cse102 5) 0)) (= 0 (mod .cse103 29)) (<= (mod .cse104 29) .cse6) (= (mod .cse105 10) 0) (< .cse104 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse107 (* 9 v_~a29~0_899))) (let ((.cse108 (div .cse107 50))) (let ((.cse106 (mod .cse108 29))) (and (<= .cse106 .cse2) (= 0 .cse106) (= (mod .cse107 10) 0) (not (< (+ .cse108 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse109 (* 9 v_~a29~0_899))) (let ((.cse110 (div .cse109 50))) (let ((.cse111 (+ .cse110 1))) (and (not (= (mod (div (+ (div .cse109 10) 1) 5) 29) 0)) (= 0 (mod .cse110 29)) (<= (mod .cse111 29) .cse6) (= (mod .cse109 10) 0) (< .cse111 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse114 (* 9 v_~a29~0_899))) (let ((.cse112 (div .cse114 50))) (let ((.cse115 (+ (div .cse114 10) 1)) (.cse113 (+ .cse112 1))) (and (not (= 0 (mod .cse112 29))) (not (= (mod .cse113 29) 0)) (not (= (mod .cse114 10) 0)) (not (= (mod .cse115 5) 0)) (<= (mod (+ (div .cse115 5) 1) 29) .cse6) (< .cse113 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse116 (* 9 v_~a29~0_899))) (let ((.cse117 (div .cse116 50))) (and (= (mod (div .cse116 10) 5) 0) (= (mod (+ .cse117 1) 29) 0) (<= (mod .cse117 29) .cse2) (not (< .cse117 0)) (= (mod .cse116 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse121 (* 9 v_~a29~0_899))) (let ((.cse120 (div .cse121 50))) (let ((.cse118 (div .cse121 10)) (.cse119 (+ .cse120 1))) (and (= (mod .cse118 5) 0) (not (= (mod .cse119 29) 0)) (not (= (mod (div (+ .cse118 1) 5) 29) 0)) (<= (mod .cse120 29) .cse6) (= (mod .cse121 10) 0) (< .cse119 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse124 (* 9 v_~a29~0_899))) (let ((.cse123 (div (+ (div .cse124 10) 1) 5))) (let ((.cse122 (mod .cse123 29))) (and (= .cse122 0) (not (< (+ .cse123 1) 0)) (<= .cse122 .cse2) (< .cse124 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse125 (div (+ (div .cse126 10) 1) 5))) (and (< .cse125 0) (<= (mod (+ .cse125 1) 29) .cse2) (not (< (+ (div .cse126 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse128 (* 9 v_~a29~0_899))) (let ((.cse127 (div (+ (div .cse128 10) 1) 5))) (and (not (< (+ .cse127 1) 0)) (<= (mod .cse127 29) .cse6) (< (+ (div .cse128 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse131 (* 9 v_~a29~0_899))) (let ((.cse130 (div .cse131 50)) (.cse129 (div .cse131 10))) (and (= (mod (div (+ .cse129 1) 5) 29) 0) (= (mod (+ .cse130 1) 29) 0) (<= (mod .cse130 29) .cse2) (not (< .cse129 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse133 (* 9 v_~a29~0_899))) (let ((.cse132 (div .cse133 10))) (let ((.cse134 (div (+ .cse132 1) 5))) (and (= (mod .cse132 5) 0) (<= (mod (div .cse133 50) 29) .cse2) (= (mod (+ .cse134 1) 29) 0) (= (mod .cse133 10) 0) (not (< .cse134 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse137 (* 9 v_~a29~0_899))) (let ((.cse136 (div .cse137 50)) (.cse135 (div .cse137 10))) (and (= (mod .cse135 5) 0) (= (mod (+ .cse136 1) 29) 0) (<= (mod .cse136 29) .cse2) (not (< (div (+ .cse135 1) 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse140 (* 9 v_~a29~0_899))) (let ((.cse138 (div .cse140 10)) (.cse139 (div .cse140 50))) (and (= (mod .cse138 5) 0) (<= (mod .cse139 29) .cse2) (= (mod (+ (div (+ .cse138 1) 5) 1) 29) 0) (<= 0 .cse139) (= (mod .cse140 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse142 (* 9 v_~a29~0_899))) (let ((.cse141 (+ (div .cse142 10) 1))) (and (not (< .cse141 0)) (<= (mod (div .cse141 5) 29) .cse2) (< .cse142 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse145 (div .cse143 50))) (let ((.cse144 (mod .cse145 29))) (and (= (mod (div .cse143 10) 5) 0) (<= .cse144 .cse2) (= 0 .cse144) (= (mod .cse143 10) 0) (not (< (+ .cse145 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse147 (* 9 v_~a29~0_899))) (let ((.cse146 (div .cse147 50))) (and (<= (mod .cse146 29) .cse2) (<= 0 .cse146) (= (mod .cse147 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse148 (* 9 v_~a29~0_899))) (let ((.cse149 (div .cse148 50))) (and (= (mod (div .cse148 10) 5) 0) (<= (mod .cse149 29) .cse2) (<= 0 .cse149))))))) is different from true