./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label55.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8 --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 b72ce2b63fc45ad9e7a0a19d4e53676fd1965a82647477e906aa1505ccdd455f --- 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-e04fb08 [2022-11-16 11:42:26,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:42:26,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:42:26,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:42:26,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:42:26,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:42:26,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:42:26,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:42:26,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:42:26,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:42:26,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:42:26,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:42:26,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:42:26,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:42:26,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:42:26,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:42:26,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:42:26,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:42:26,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:42:26,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:42:26,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:42:26,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:42:26,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:42:26,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:42:26,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:42:26,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:42:26,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:42:26,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:42:26,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:42:26,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:42:26,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:42:26,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:42:26,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:42:26,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:42:26,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:42:26,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:42:26,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:42:26,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:42:26,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:42:26,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:42:26,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:42:26,457 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:42:26,503 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:42:26,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:42:26,504 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:42:26,504 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:42:26,505 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:42:26,505 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:42:26,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:42:26,506 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:42:26,507 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:42:26,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:42:26,507 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:42:26,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:42:26,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:42:26,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:42:26,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:42:26,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:42:26,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:42:26,509 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:42:26,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:42:26,510 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:42:26,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:42:26,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:42:26,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:42:26,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:42:26,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:42:26,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:42:26,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:42:26,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:42:26,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:42:26,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:42:26,515 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:42:26,515 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:42:26,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:42:26,516 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_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/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_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8 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 -> b72ce2b63fc45ad9e7a0a19d4e53676fd1965a82647477e906aa1505ccdd455f [2022-11-16 11:42:26,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:42:26,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:42:26,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:42:26,931 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:42:26,932 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:42:26,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/eca-rers2012/Problem15_label55.c [2022-11-16 11:42:27,016 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/data/73c84fe19/34e5ba03b7a14bcdbe86a6083f6c7632/FLAG5d1dcaaba [2022-11-16 11:42:27,764 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:42:27,765 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/sv-benchmarks/c/eca-rers2012/Problem15_label55.c [2022-11-16 11:42:27,796 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/data/73c84fe19/34e5ba03b7a14bcdbe86a6083f6c7632/FLAG5d1dcaaba [2022-11-16 11:42:27,881 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/data/73c84fe19/34e5ba03b7a14bcdbe86a6083f6c7632 [2022-11-16 11:42:27,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:42:27,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:42:27,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:42:27,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:42:27,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:42:27,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:42:27" (1/1) ... [2022-11-16 11:42:27,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c05e876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:27, skipping insertion in model container [2022-11-16 11:42:27,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:42:27" (1/1) ... [2022-11-16 11:42:27,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:42:28,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:42:28,292 WARN L229 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_6c295164-034f-42af-b59b-8b8388bcffaf/sv-benchmarks/c/eca-rers2012/Problem15_label55.c[6938,6951] [2022-11-16 11:42:28,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:42:28,885 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:42:28,937 WARN L229 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_6c295164-034f-42af-b59b-8b8388bcffaf/sv-benchmarks/c/eca-rers2012/Problem15_label55.c[6938,6951] [2022-11-16 11:42:29,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:42:29,291 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:42:29,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:29 WrapperNode [2022-11-16 11:42:29,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:42:29,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:42:29,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:42:29,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:42:29,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:29" (1/1) ... [2022-11-16 11:42:29,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:29" (1/1) ... [2022-11-16 11:42:29,561 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1758 [2022-11-16 11:42:29,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:42:29,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:42:29,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:42:29,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:42:29,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:29" (1/1) ... [2022-11-16 11:42:29,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:29" (1/1) ... [2022-11-16 11:42:29,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:29" (1/1) ... [2022-11-16 11:42:29,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:29" (1/1) ... [2022-11-16 11:42:29,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:29" (1/1) ... [2022-11-16 11:42:29,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:29" (1/1) ... [2022-11-16 11:42:29,834 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:29" (1/1) ... [2022-11-16 11:42:29,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:29" (1/1) ... [2022-11-16 11:42:29,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:42:29,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:42:29,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:42:29,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:42:29,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:29" (1/1) ... [2022-11-16 11:42:29,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:42:29,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:29,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:42:29,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:42:29,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:42:29,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:42:29,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:42:29,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:42:30,038 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:42:30,041 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:42:34,222 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:42:34,236 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:42:34,236 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:42:34,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:34 BoogieIcfgContainer [2022-11-16 11:42:34,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:42:34,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:42:34,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:42:34,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:42:34,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:42:27" (1/3) ... [2022-11-16 11:42:34,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273b5493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:42:34, skipping insertion in model container [2022-11-16 11:42:34,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:29" (2/3) ... [2022-11-16 11:42:34,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273b5493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:42:34, skipping insertion in model container [2022-11-16 11:42:34,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:34" (3/3) ... [2022-11-16 11:42:34,259 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label55.c [2022-11-16 11:42:34,281 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:42:34,281 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:42:34,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:42:34,408 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;@52086b9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:42:34,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:42:34,419 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-16 11:42:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 11:42:34,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:34,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:34,436 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:42:34,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:34,445 INFO L85 PathProgramCache]: Analyzing trace with hash -66916295, now seen corresponding path program 1 times [2022-11-16 11:42:34,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:34,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473467882] [2022-11-16 11:42:34,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:34,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:34,937 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-16 11:42:34,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:34,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473467882] [2022-11-16 11:42:34,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473467882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:34,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:34,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:34,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074981361] [2022-11-16 11:42:34,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:34,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:34,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:34,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:34,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:34,981 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 19.0) internal successors, (57), 2 states have internal predecessors, (57), 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-16 11:42:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:37,912 INFO L93 Difference]: Finished difference Result 1155 states and 2106 transitions. [2022-11-16 11:42:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:37,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 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 57 [2022-11-16 11:42:37,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:37,933 INFO L225 Difference]: With dead ends: 1155 [2022-11-16 11:42:37,933 INFO L226 Difference]: Without dead ends: 667 [2022-11-16 11:42:37,938 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-16 11:42:37,941 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 287 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 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.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:37,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 371 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-16 11:42:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-11-16 11:42:38,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2022-11-16 11:42:38,026 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-16 11:42:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2022-11-16 11:42:38,030 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 57 [2022-11-16 11:42:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:38,031 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2022-11-16 11:42:38,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 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-16 11:42:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2022-11-16 11:42:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-16 11:42:38,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:38,035 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, 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] [2022-11-16 11:42:38,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:42:38,036 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:42:38,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:38,037 INFO L85 PathProgramCache]: Analyzing trace with hash -664289441, now seen corresponding path program 1 times [2022-11-16 11:42:38,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:38,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565148658] [2022-11-16 11:42:38,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:38,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:38,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:38,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565148658] [2022-11-16 11:42:38,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565148658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:38,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:38,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:38,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624543399] [2022-11-16 11:42:38,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:38,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:38,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:38,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:38,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:38,385 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-16 11:42:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:41,302 INFO L93 Difference]: Finished difference Result 1953 states and 2893 transitions. [2022-11-16 11:42:41,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:41,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 132 [2022-11-16 11:42:41,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:41,309 INFO L225 Difference]: With dead ends: 1953 [2022-11-16 11:42:41,310 INFO L226 Difference]: Without dead ends: 1290 [2022-11-16 11:42:41,312 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-16 11:42:41,314 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 257 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 2.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:41,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 325 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-16 11:42:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-11-16 11:42:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282. [2022-11-16 11:42:41,363 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-16 11:42:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1792 transitions. [2022-11-16 11:42:41,368 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1792 transitions. Word has length 132 [2022-11-16 11:42:41,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:41,369 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1792 transitions. [2022-11-16 11:42:41,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-16 11:42:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1792 transitions. [2022-11-16 11:42:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-16 11:42:41,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:41,375 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:41,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:42:41,375 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:42:41,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:41,376 INFO L85 PathProgramCache]: Analyzing trace with hash 22508777, now seen corresponding path program 1 times [2022-11-16 11:42:41,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:41,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870728238] [2022-11-16 11:42:41,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:41,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:41,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:41,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870728238] [2022-11-16 11:42:41,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870728238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:41,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:41,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:41,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978862872] [2022-11-16 11:42:41,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:41,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:41,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:41,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:41,586 INFO L87 Difference]: Start difference. First operand 1282 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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-16 11:42:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:44,242 INFO L93 Difference]: Finished difference Result 3764 states and 5263 transitions. [2022-11-16 11:42:44,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:44,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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 136 [2022-11-16 11:42:44,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:44,252 INFO L225 Difference]: With dead ends: 3764 [2022-11-16 11:42:44,253 INFO L226 Difference]: Without dead ends: 2484 [2022-11-16 11:42:44,255 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-16 11:42:44,256 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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, 2.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:44,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 366 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-16 11:42:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2022-11-16 11:42:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2182. [2022-11-16 11:42:44,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-16 11:42:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2795 transitions. [2022-11-16 11:42:44,313 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2795 transitions. Word has length 136 [2022-11-16 11:42:44,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:44,314 INFO L495 AbstractCegarLoop]: Abstraction has 2182 states and 2795 transitions. [2022-11-16 11:42:44,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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-16 11:42:44,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2795 transitions. [2022-11-16 11:42:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-11-16 11:42:44,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:44,323 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:44,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:42:44,324 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:42:44,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1359144620, now seen corresponding path program 1 times [2022-11-16 11:42:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:44,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637783361] [2022-11-16 11:42:44,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:44,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-16 11:42:44,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:44,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637783361] [2022-11-16 11:42:44,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637783361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:44,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:44,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:44,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668086382] [2022-11-16 11:42:44,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:44,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:44,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:44,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:44,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:44,767 INFO L87 Difference]: Start difference. First operand 2182 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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-16 11:42:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:47,291 INFO L93 Difference]: Finished difference Result 6166 states and 7961 transitions. [2022-11-16 11:42:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:47,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 227 [2022-11-16 11:42:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:47,309 INFO L225 Difference]: With dead ends: 6166 [2022-11-16 11:42:47,310 INFO L226 Difference]: Without dead ends: 3986 [2022-11-16 11:42:47,313 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-16 11:42:47,324 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.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:47,327 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.4s Time] [2022-11-16 11:42:47,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2022-11-16 11:42:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3682. [2022-11-16 11:42:47,415 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-16 11:42:47,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4491 transitions. [2022-11-16 11:42:47,426 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4491 transitions. Word has length 227 [2022-11-16 11:42:47,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:47,427 INFO L495 AbstractCegarLoop]: Abstraction has 3682 states and 4491 transitions. [2022-11-16 11:42:47,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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-16 11:42:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4491 transitions. [2022-11-16 11:42:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2022-11-16 11:42:47,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:47,438 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:42:47,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:42:47,439 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:42:47,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:47,439 INFO L85 PathProgramCache]: Analyzing trace with hash -764479700, now seen corresponding path program 1 times [2022-11-16 11:42:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:47,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423940831] [2022-11-16 11:42:47,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:47,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-16 11:42:48,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:48,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423940831] [2022-11-16 11:42:48,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423940831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:48,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:48,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:48,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134649216] [2022-11-16 11:42:48,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:48,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:48,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:48,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:48,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:48,471 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-16 11:42:51,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:51,062 INFO L93 Difference]: Finished difference Result 7661 states and 9291 transitions. [2022-11-16 11:42:51,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:51,064 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 329 [2022-11-16 11:42:51,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:51,078 INFO L225 Difference]: With dead ends: 7661 [2022-11-16 11:42:51,078 INFO L226 Difference]: Without dead ends: 3981 [2022-11-16 11:42:51,082 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-16 11:42:51,083 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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-16 11:42:51,084 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-16 11:42:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2022-11-16 11:42:51,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2022-11-16 11:42:51,170 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-16 11:42:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4796 transitions. [2022-11-16 11:42:51,180 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 4796 transitions. Word has length 329 [2022-11-16 11:42:51,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:51,182 INFO L495 AbstractCegarLoop]: Abstraction has 3981 states and 4796 transitions. [2022-11-16 11:42:51,183 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-16 11:42:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 4796 transitions. [2022-11-16 11:42:51,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2022-11-16 11:42:51,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:51,194 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:42:51,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:42:51,196 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:42:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1396325859, now seen corresponding path program 1 times [2022-11-16 11:42:51,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:51,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722378685] [2022-11-16 11:42:51,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:51,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-16 11:42:51,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:51,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722378685] [2022-11-16 11:42:51,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722378685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:51,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:51,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:42:51,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922770940] [2022-11-16 11:42:51,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:51,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:51,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:51,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:51,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:51,629 INFO L87 Difference]: Start difference. First operand 3981 states and 4796 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-16 11:42:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:54,468 INFO L93 Difference]: Finished difference Result 9465 states and 11674 transitions. [2022-11-16 11:42:54,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:54,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2022-11-16 11:42:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:54,491 INFO L225 Difference]: With dead ends: 9465 [2022-11-16 11:42:54,491 INFO L226 Difference]: Without dead ends: 5785 [2022-11-16 11:42:54,496 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-16 11:42:54,497 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 259 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 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-16 11:42:54,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 671 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-16 11:42:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2022-11-16 11:42:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5783. [2022-11-16 11:42:54,603 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-16 11:42:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 6751 transitions. [2022-11-16 11:42:54,615 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 6751 transitions. Word has length 344 [2022-11-16 11:42:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:54,616 INFO L495 AbstractCegarLoop]: Abstraction has 5783 states and 6751 transitions. [2022-11-16 11:42:54,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-16 11:42:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 6751 transitions. [2022-11-16 11:42:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-11-16 11:42:54,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:54,625 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:42:54,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:42:54,626 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:42:54,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:54,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1074223962, now seen corresponding path program 1 times [2022-11-16 11:42:54,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:54,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154034820] [2022-11-16 11:42:54,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:54,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-16 11:42:55,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:55,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154034820] [2022-11-16 11:42:55,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154034820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:55,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:55,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:42:55,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707888086] [2022-11-16 11:42:55,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:55,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:55,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:55,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:55,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:55,228 INFO L87 Difference]: Start difference. First operand 5783 states and 6751 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-16 11:42:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:57,896 INFO L93 Difference]: Finished difference Result 13364 states and 15910 transitions. [2022-11-16 11:42:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:57,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 403 [2022-11-16 11:42:57,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:57,924 INFO L225 Difference]: With dead ends: 13364 [2022-11-16 11:42:57,924 INFO L226 Difference]: Without dead ends: 7882 [2022-11-16 11:42:57,931 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-16 11:42:57,932 INFO L413 NwaCegarLoop]: 598 mSDtfsCounter, 270 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 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.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:57,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 635 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-16 11:42:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7882 states. [2022-11-16 11:42:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7882 to 7284. [2022-11-16 11:42:58,067 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-16 11:42:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 8366 transitions. [2022-11-16 11:42:58,088 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 8366 transitions. Word has length 403 [2022-11-16 11:42:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:58,089 INFO L495 AbstractCegarLoop]: Abstraction has 7284 states and 8366 transitions. [2022-11-16 11:42:58,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-16 11:42:58,090 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 8366 transitions. [2022-11-16 11:42:58,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2022-11-16 11:42:58,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:58,101 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:42:58,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:42:58,102 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:42:58,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:58,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1496156917, now seen corresponding path program 1 times [2022-11-16 11:42:58,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:58,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888701456] [2022-11-16 11:42:58,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:58,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-16 11:42:58,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:58,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888701456] [2022-11-16 11:42:58,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888701456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:58,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:58,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:42:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366435161] [2022-11-16 11:42:58,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:58,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:58,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:58,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:58,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:58,637 INFO L87 Difference]: Start difference. First operand 7284 states and 8366 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-16 11:43:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:01,164 INFO L93 Difference]: Finished difference Result 16069 states and 18814 transitions. [2022-11-16 11:43:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:01,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 418 [2022-11-16 11:43:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:01,198 INFO L225 Difference]: With dead ends: 16069 [2022-11-16 11:43:01,198 INFO L226 Difference]: Without dead ends: 9086 [2022-11-16 11:43:01,208 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-16 11:43:01,208 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 272 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 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.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:01,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 623 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-16 11:43:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2022-11-16 11:43:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 8481. [2022-11-16 11:43:01,412 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-16 11:43:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 9650 transitions. [2022-11-16 11:43:01,429 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 9650 transitions. Word has length 418 [2022-11-16 11:43:01,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:01,430 INFO L495 AbstractCegarLoop]: Abstraction has 8481 states and 9650 transitions. [2022-11-16 11:43:01,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-16 11:43:01,431 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 9650 transitions. [2022-11-16 11:43:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2022-11-16 11:43:01,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:01,445 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 11:43:01,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:43:01,446 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:01,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1478191957, now seen corresponding path program 1 times [2022-11-16 11:43:01,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:01,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450930263] [2022-11-16 11:43:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-11-16 11:43:01,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:01,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450930263] [2022-11-16 11:43:01,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450930263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:01,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:01,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:01,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576607649] [2022-11-16 11:43:01,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:01,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:01,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:01,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:01,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:01,904 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-16 11:43:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:04,359 INFO L93 Difference]: Finished difference Result 19651 states and 22543 transitions. [2022-11-16 11:43:04,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:04,361 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 508 [2022-11-16 11:43:04,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:04,384 INFO L225 Difference]: With dead ends: 19651 [2022-11-16 11:43:04,384 INFO L226 Difference]: Without dead ends: 11471 [2022-11-16 11:43:04,393 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-16 11:43:04,394 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:04,394 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.3s Time] [2022-11-16 11:43:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2022-11-16 11:43:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 7578. [2022-11-16 11:43:04,536 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-16 11:43:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 8703 transitions. [2022-11-16 11:43:04,551 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 8703 transitions. Word has length 508 [2022-11-16 11:43:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:04,552 INFO L495 AbstractCegarLoop]: Abstraction has 7578 states and 8703 transitions. [2022-11-16 11:43:04,552 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-16 11:43:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 8703 transitions. [2022-11-16 11:43:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2022-11-16 11:43:04,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:04,560 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, 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, 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-16 11:43:04,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:43:04,561 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:04,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:04,562 INFO L85 PathProgramCache]: Analyzing trace with hash -732988878, now seen corresponding path program 1 times [2022-11-16 11:43:04,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:04,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591272553] [2022-11-16 11:43:04,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:04,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 519 proven. 39 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-11-16 11:43:05,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:05,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591272553] [2022-11-16 11:43:05,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591272553] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:43:05,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219200988] [2022-11-16 11:43:05,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:05,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:43:05,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:43:05,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:43:05,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:43:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:05,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:43:05,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-11-16 11:43:06,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:06,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219200988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:06,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:43:06,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-16 11:43:06,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389755384] [2022-11-16 11:43:06,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:06,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:06,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:06,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:06,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:43:06,238 INFO L87 Difference]: Start difference. First operand 7578 states and 8703 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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-16 11:43:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:08,686 INFO L93 Difference]: Finished difference Result 17246 states and 20055 transitions. [2022-11-16 11:43:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:08,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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 541 [2022-11-16 11:43:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:08,706 INFO L225 Difference]: With dead ends: 17246 [2022-11-16 11:43:08,706 INFO L226 Difference]: Without dead ends: 9969 [2022-11-16 11:43:08,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 540 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-16 11:43:08,713 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 360 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:08,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 447 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-16 11:43:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9969 states. [2022-11-16 11:43:08,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9969 to 9969. [2022-11-16 11:43:08,863 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-16 11:43:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9969 states to 9969 states and 11463 transitions. [2022-11-16 11:43:08,879 INFO L78 Accepts]: Start accepts. Automaton has 9969 states and 11463 transitions. Word has length 541 [2022-11-16 11:43:08,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:08,880 INFO L495 AbstractCegarLoop]: Abstraction has 9969 states and 11463 transitions. [2022-11-16 11:43:08,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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-16 11:43:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 9969 states and 11463 transitions. [2022-11-16 11:43:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2022-11-16 11:43:08,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:08,887 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, 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, 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-16 11:43:08,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:43:09,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 11:43:09,105 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:09,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash -93352388, now seen corresponding path program 1 times [2022-11-16 11:43:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:09,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301693353] [2022-11-16 11:43:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-11-16 11:43:09,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:09,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301693353] [2022-11-16 11:43:09,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301693353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:09,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:09,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021275741] [2022-11-16 11:43:09,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:09,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:09,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:09,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:09,888 INFO L87 Difference]: Start difference. First operand 9969 states and 11463 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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-16 11:43:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:12,860 INFO L93 Difference]: Finished difference Result 24136 states and 28002 transitions. [2022-11-16 11:43:12,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:12,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 545 [2022-11-16 11:43:12,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:12,886 INFO L225 Difference]: With dead ends: 24136 [2022-11-16 11:43:12,886 INFO L226 Difference]: Without dead ends: 14468 [2022-11-16 11:43:12,896 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-16 11:43:12,897 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:12,897 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.8s Time] [2022-11-16 11:43:12,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14468 states. [2022-11-16 11:43:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14468 to 14158. [2022-11-16 11:43:13,102 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-16 11:43:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 16066 transitions. [2022-11-16 11:43:13,125 INFO L78 Accepts]: Start accepts. Automaton has 14158 states and 16066 transitions. Word has length 545 [2022-11-16 11:43:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:13,126 INFO L495 AbstractCegarLoop]: Abstraction has 14158 states and 16066 transitions. [2022-11-16 11:43:13,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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-16 11:43:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 14158 states and 16066 transitions. [2022-11-16 11:43:13,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2022-11-16 11:43:13,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:13,140 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, 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, 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-16 11:43:13,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:43:13,141 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:13,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:13,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1966218800, now seen corresponding path program 1 times [2022-11-16 11:43:13,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:13,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959309183] [2022-11-16 11:43:13,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:13,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 676 proven. 39 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2022-11-16 11:43:14,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:14,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959309183] [2022-11-16 11:43:14,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959309183] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:43:14,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124692495] [2022-11-16 11:43:14,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:14,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:43:14,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:43:14,210 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:43:14,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:43:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:14,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:43:14,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-11-16 11:43:14,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:14,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124692495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:14,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:43:14,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-16 11:43:14,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093983112] [2022-11-16 11:43:14,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:14,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:14,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:14,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:43:14,778 INFO L87 Difference]: Start difference. First operand 14158 states and 16066 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-16 11:43:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:17,224 INFO L93 Difference]: Finished difference Result 27712 states and 31490 transitions. [2022-11-16 11:43:17,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:17,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 620 [2022-11-16 11:43:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:17,244 INFO L225 Difference]: With dead ends: 27712 [2022-11-16 11:43:17,244 INFO L226 Difference]: Without dead ends: 13855 [2022-11-16 11:43:17,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 619 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-16 11:43:17,257 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-16 11:43:17,258 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-16 11:43:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13855 states. [2022-11-16 11:43:17,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13855 to 13854. [2022-11-16 11:43:17,442 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-16 11:43:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13854 states to 13854 states and 14984 transitions. [2022-11-16 11:43:17,573 INFO L78 Accepts]: Start accepts. Automaton has 13854 states and 14984 transitions. Word has length 620 [2022-11-16 11:43:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:17,575 INFO L495 AbstractCegarLoop]: Abstraction has 13854 states and 14984 transitions. [2022-11-16 11:43:17,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-16 11:43:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 13854 states and 14984 transitions. [2022-11-16 11:43:17,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2022-11-16 11:43:17,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:17,602 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, 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, 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-16 11:43:17,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:43:17,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 11:43:17,809 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:17,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:17,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1575532913, now seen corresponding path program 1 times [2022-11-16 11:43:17,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:17,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051323990] [2022-11-16 11:43:17,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:17,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 603 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-11-16 11:43:18,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:18,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051323990] [2022-11-16 11:43:18,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051323990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:43:18,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052932537] [2022-11-16 11:43:18,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:18,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:43:18,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:43:18,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:43:19,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:43:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:19,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:43:19,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 603 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-11-16 11:43:20,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:43:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 603 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-11-16 11:43:21,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052932537] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:43:21,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:43:21,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-11-16 11:43:21,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381209525] [2022-11-16 11:43:21,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:43:21,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:43:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:21,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:43:21,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:43:21,531 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-16 11:43:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:30,877 INFO L93 Difference]: Finished difference Result 35741 states and 38659 transitions. [2022-11-16 11:43:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:43:30,878 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 621 [2022-11-16 11:43:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:30,891 INFO L225 Difference]: With dead ends: 35741 [2022-11-16 11:43:30,891 INFO L226 Difference]: Without dead ends: 16247 [2022-11-16 11:43:30,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1251 GetRequests, 1236 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:43:30,902 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 2855 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 5909 mSolverCounterSat, 661 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2855 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 6570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 661 IncrementalHoareTripleChecker+Valid, 5909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:30,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2855 Valid, 246 Invalid, 6570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [661 Valid, 5909 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-11-16 11:43:30,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16247 states. [2022-11-16 11:43:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16247 to 12357. [2022-11-16 11:43:31,148 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-16 11:43:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12357 states to 12357 states and 12833 transitions. [2022-11-16 11:43:31,167 INFO L78 Accepts]: Start accepts. Automaton has 12357 states and 12833 transitions. Word has length 621 [2022-11-16 11:43:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:31,167 INFO L495 AbstractCegarLoop]: Abstraction has 12357 states and 12833 transitions. [2022-11-16 11:43:31,168 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-16 11:43:31,168 INFO L276 IsEmpty]: Start isEmpty. Operand 12357 states and 12833 transitions. [2022-11-16 11:43:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2022-11-16 11:43:31,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:31,179 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 11:43:31,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:43:31,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 11:43:31,387 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:31,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:31,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1914023780, now seen corresponding path program 1 times [2022-11-16 11:43:31,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:31,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731404499] [2022-11-16 11:43:31,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:31,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2022-11-16 11:43:31,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:31,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731404499] [2022-11-16 11:43:31,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731404499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:31,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:31,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321337058] [2022-11-16 11:43:31,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:31,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:31,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:31,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:31,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:31,995 INFO L87 Difference]: Start difference. First operand 12357 states and 12833 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-16 11:43:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:33,562 INFO L93 Difference]: Finished difference Result 28295 states and 29436 transitions. [2022-11-16 11:43:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:33,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 658 [2022-11-16 11:43:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:33,582 INFO L225 Difference]: With dead ends: 28295 [2022-11-16 11:43:33,582 INFO L226 Difference]: Without dead ends: 15940 [2022-11-16 11:43:33,589 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-16 11:43:33,590 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 257 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 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.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:33,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 536 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-16 11:43:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2022-11-16 11:43:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 15043. [2022-11-16 11:43:33,800 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-16 11:43:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 15538 transitions. [2022-11-16 11:43:33,823 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 15538 transitions. Word has length 658 [2022-11-16 11:43:33,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:33,824 INFO L495 AbstractCegarLoop]: Abstraction has 15043 states and 15538 transitions. [2022-11-16 11:43:33,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-16 11:43:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 15538 transitions. [2022-11-16 11:43:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2022-11-16 11:43:33,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:33,840 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 11:43:33,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:43:33,841 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:33,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:33,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1275389892, now seen corresponding path program 1 times [2022-11-16 11:43:33,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:33,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460121391] [2022-11-16 11:43:33,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:33,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2022-11-16 11:43:34,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:34,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460121391] [2022-11-16 11:43:34,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460121391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:34,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:34,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:43:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085010606] [2022-11-16 11:43:34,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:34,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:43:34,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:34,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:43:34,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:43:34,665 INFO L87 Difference]: Start difference. First operand 15043 states and 15538 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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-16 11:43:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:36,998 INFO L93 Difference]: Finished difference Result 33973 states and 35169 transitions. [2022-11-16 11:43:36,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:43:36,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 682 [2022-11-16 11:43:36,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:37,014 INFO L225 Difference]: With dead ends: 33973 [2022-11-16 11:43:37,014 INFO L226 Difference]: Without dead ends: 18932 [2022-11-16 11:43:37,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:43:37,025 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 675 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:37,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 426 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-16 11:43:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18932 states. [2022-11-16 11:43:37,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18932 to 18035. [2022-11-16 11:43:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18035 states, 18034 states have (on average 1.0311633581013642) internal successors, (18596), 18034 states have internal predecessors, (18596), 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-16 11:43:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18035 states to 18035 states and 18596 transitions. [2022-11-16 11:43:37,291 INFO L78 Accepts]: Start accepts. Automaton has 18035 states and 18596 transitions. Word has length 682 [2022-11-16 11:43:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:37,292 INFO L495 AbstractCegarLoop]: Abstraction has 18035 states and 18596 transitions. [2022-11-16 11:43:37,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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-16 11:43:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 18035 states and 18596 transitions. [2022-11-16 11:43:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2022-11-16 11:43:37,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:37,308 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:43:37,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:43:37,309 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:37,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash -402468340, now seen corresponding path program 1 times [2022-11-16 11:43:37,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:37,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134985582] [2022-11-16 11:43:37,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:37,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2022-11-16 11:43:37,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:37,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134985582] [2022-11-16 11:43:37,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134985582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:37,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:37,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:37,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571577783] [2022-11-16 11:43:37,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:37,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:37,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:37,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:37,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:37,863 INFO L87 Difference]: Start difference. First operand 18035 states and 18596 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-16 11:43:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:39,282 INFO L93 Difference]: Finished difference Result 36065 states and 37196 transitions. [2022-11-16 11:43:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:39,283 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 713 [2022-11-16 11:43:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:39,304 INFO L225 Difference]: With dead ends: 36065 [2022-11-16 11:43:39,304 INFO L226 Difference]: Without dead ends: 18331 [2022-11-16 11:43:39,314 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-16 11:43:39,315 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 435 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:39,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 67 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-16 11:43:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18331 states. [2022-11-16 11:43:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18331 to 18031. [2022-11-16 11:43:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18031 states, 18030 states have (on average 1.031003882418192) internal successors, (18589), 18030 states have internal predecessors, (18589), 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-16 11:43:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18031 states to 18031 states and 18589 transitions. [2022-11-16 11:43:39,577 INFO L78 Accepts]: Start accepts. Automaton has 18031 states and 18589 transitions. Word has length 713 [2022-11-16 11:43:39,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:39,578 INFO L495 AbstractCegarLoop]: Abstraction has 18031 states and 18589 transitions. [2022-11-16 11:43:39,578 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-16 11:43:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 18031 states and 18589 transitions. [2022-11-16 11:43:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2022-11-16 11:43:39,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:39,597 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, 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, 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-16 11:43:39,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:43:39,597 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:39,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:39,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1638431091, now seen corresponding path program 1 times [2022-11-16 11:43:39,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:39,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877830272] [2022-11-16 11:43:39,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:39,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2022-11-16 11:43:40,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:40,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877830272] [2022-11-16 11:43:40,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877830272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:40,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:40,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:40,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184353820] [2022-11-16 11:43:40,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:40,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:40,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:40,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:40,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:40,455 INFO L87 Difference]: Start difference. First operand 18031 states and 18589 transitions. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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-16 11:43:42,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:42,087 INFO L93 Difference]: Finished difference Result 38449 states and 39675 transitions. [2022-11-16 11:43:42,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:42,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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 784 [2022-11-16 11:43:42,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:42,112 INFO L225 Difference]: With dead ends: 38449 [2022-11-16 11:43:42,112 INFO L226 Difference]: Without dead ends: 20719 [2022-11-16 11:43:42,122 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-16 11:43:42,123 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 184 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:42,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 161 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-16 11:43:42,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20719 states. [2022-11-16 11:43:42,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20719 to 19523. [2022-11-16 11:43:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19523 states, 19522 states have (on average 1.0284806884540518) internal successors, (20078), 19522 states have internal predecessors, (20078), 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-16 11:43:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19523 states to 19523 states and 20078 transitions. [2022-11-16 11:43:42,369 INFO L78 Accepts]: Start accepts. Automaton has 19523 states and 20078 transitions. Word has length 784 [2022-11-16 11:43:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:42,369 INFO L495 AbstractCegarLoop]: Abstraction has 19523 states and 20078 transitions. [2022-11-16 11:43:42,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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-16 11:43:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 19523 states and 20078 transitions. [2022-11-16 11:43:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2022-11-16 11:43:42,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:42,383 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-16 11:43:42,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:43:42,384 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:42,384 INFO L85 PathProgramCache]: Analyzing trace with hash -523331930, now seen corresponding path program 1 times [2022-11-16 11:43:42,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:42,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674244967] [2022-11-16 11:43:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:42,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 749 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-11-16 11:43:42,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:42,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674244967] [2022-11-16 11:43:42,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674244967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:42,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:42,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:42,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011214886] [2022-11-16 11:43:42,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:42,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:42,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:42,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:42,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:42,949 INFO L87 Difference]: Start difference. First operand 19523 states and 20078 transitions. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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-16 11:43:44,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:44,565 INFO L93 Difference]: Finished difference Result 41433 states and 42655 transitions. [2022-11-16 11:43:44,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:44,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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 805 [2022-11-16 11:43:44,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:44,586 INFO L225 Difference]: With dead ends: 41433 [2022-11-16 11:43:44,586 INFO L226 Difference]: Without dead ends: 21912 [2022-11-16 11:43:44,595 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-16 11:43:44,595 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 163 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:44,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 460 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-16 11:43:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21912 states. [2022-11-16 11:43:44,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21912 to 17124. [2022-11-16 11:43:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17124 states, 17123 states have (on average 1.0263972434736903) internal successors, (17575), 17123 states have internal predecessors, (17575), 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-16 11:43:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17124 states to 17124 states and 17575 transitions. [2022-11-16 11:43:44,807 INFO L78 Accepts]: Start accepts. Automaton has 17124 states and 17575 transitions. Word has length 805 [2022-11-16 11:43:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:44,808 INFO L495 AbstractCegarLoop]: Abstraction has 17124 states and 17575 transitions. [2022-11-16 11:43:44,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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-16 11:43:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 17124 states and 17575 transitions. [2022-11-16 11:43:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2022-11-16 11:43:44,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:44,823 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 11:43:44,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:43:44,824 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:44,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1479206236, now seen corresponding path program 1 times [2022-11-16 11:43:44,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:44,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792075832] [2022-11-16 11:43:44,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:44,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2022-11-16 11:43:45,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:45,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792075832] [2022-11-16 11:43:45,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792075832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:45,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:45,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:45,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401245802] [2022-11-16 11:43:45,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:45,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:45,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:45,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:45,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:45,385 INFO L87 Difference]: Start difference. First operand 17124 states and 17575 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-16 11:43:46,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:46,811 INFO L93 Difference]: Finished difference Result 36039 states and 37016 transitions. [2022-11-16 11:43:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:46,811 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 842 [2022-11-16 11:43:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:46,827 INFO L225 Difference]: With dead ends: 36039 [2022-11-16 11:43:46,827 INFO L226 Difference]: Without dead ends: 19216 [2022-11-16 11:43:46,834 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-16 11:43:46,835 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 310 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:46,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 504 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-16 11:43:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19216 states. [2022-11-16 11:43:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19216 to 18020. [2022-11-16 11:43:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18020 states, 18019 states have (on average 1.0254176147399967) internal successors, (18477), 18019 states have internal predecessors, (18477), 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-16 11:43:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18020 states to 18020 states and 18477 transitions. [2022-11-16 11:43:47,031 INFO L78 Accepts]: Start accepts. Automaton has 18020 states and 18477 transitions. Word has length 842 [2022-11-16 11:43:47,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:47,031 INFO L495 AbstractCegarLoop]: Abstraction has 18020 states and 18477 transitions. [2022-11-16 11:43:47,032 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-16 11:43:47,032 INFO L276 IsEmpty]: Start isEmpty. Operand 18020 states and 18477 transitions. [2022-11-16 11:43:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2022-11-16 11:43:47,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:47,044 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 11:43:47,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:43:47,045 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:47,045 INFO L85 PathProgramCache]: Analyzing trace with hash -537887034, now seen corresponding path program 1 times [2022-11-16 11:43:47,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:47,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383446469] [2022-11-16 11:43:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:47,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 629 proven. 269 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-11-16 11:43:49,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:49,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383446469] [2022-11-16 11:43:49,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383446469] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:43:49,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563226008] [2022-11-16 11:43:49,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:49,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:43:49,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:43:49,291 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:43:49,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:43:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:49,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:43:49,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2022-11-16 11:43:50,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:50,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563226008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:50,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:43:50,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-16 11:43:50,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282093824] [2022-11-16 11:43:50,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:50,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:50,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:50,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:50,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:43:50,022 INFO L87 Difference]: Start difference. First operand 18020 states and 18477 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-16 11:43:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:51,887 INFO L93 Difference]: Finished difference Result 39939 states and 40943 transitions. [2022-11-16 11:43:51,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:51,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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 863 [2022-11-16 11:43:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:51,918 INFO L225 Difference]: With dead ends: 39939 [2022-11-16 11:43:51,918 INFO L226 Difference]: Without dead ends: 21921 [2022-11-16 11:43:51,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 862 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-16 11:43:51,933 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 271 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:51,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 493 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-16 11:43:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21921 states. [2022-11-16 11:43:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21921 to 19818. [2022-11-16 11:43:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19818 states, 19817 states have (on average 1.025129938941313) internal successors, (20315), 19817 states have internal predecessors, (20315), 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-16 11:43:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19818 states to 19818 states and 20315 transitions. [2022-11-16 11:43:52,216 INFO L78 Accepts]: Start accepts. Automaton has 19818 states and 20315 transitions. Word has length 863 [2022-11-16 11:43:52,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:52,217 INFO L495 AbstractCegarLoop]: Abstraction has 19818 states and 20315 transitions. [2022-11-16 11:43:52,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-16 11:43:52,217 INFO L276 IsEmpty]: Start isEmpty. Operand 19818 states and 20315 transitions. [2022-11-16 11:43:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2022-11-16 11:43:52,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:52,230 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 11:43:52,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:43:52,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:43:52,432 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:52,432 INFO L85 PathProgramCache]: Analyzing trace with hash 943867835, now seen corresponding path program 1 times [2022-11-16 11:43:52,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:52,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886975996] [2022-11-16 11:43:52,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:52,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 703 proven. 269 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-11-16 11:43:54,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:54,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886975996] [2022-11-16 11:43:54,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886975996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:43:54,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865693430] [2022-11-16 11:43:54,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:54,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:43:54,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:43:54,867 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:43:54,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c295164-034f-42af-b59b-8b8388bcffaf/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:43:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:55,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:43:55,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:45,180 WARN L233 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 13 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:52:01,324 WARN L855 $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 ((.cse13 (* 9 v_~a29~0_899))) (and (= (mod (+ (div (+ (div .cse13 10) 1) 5) 1) 29) 0) (= 0 (mod (div .cse13 50) 29)) (= (mod .cse13 10) 0)))) (exists ((v_~a29~0_899 Int)) (let ((.cse16 (* 9 v_~a29~0_899))) (let ((.cse14 (div .cse16 10))) (let ((.cse15 (div (+ .cse14 1) 5))) (and (= (mod .cse14 5) 0) (= (mod .cse15 29) 0) (<= (mod (div .cse16 50) 29) .cse2) (= (mod .cse16 10) 0) (<= 0 (+ .cse15 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse19 (* 9 v_~a29~0_899))) (let ((.cse17 (div .cse19 10))) (let ((.cse18 (div (+ .cse17 1) 5))) (and (= (mod .cse17 5) 0) (= (mod .cse18 29) 0) (<= (mod (div .cse19 50) 29) .cse2) (<= 0 (+ .cse18 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse21 (* 9 v_~a29~0_899))) (let ((.cse20 (+ (div .cse21 10) 1))) (and (<= (mod (div .cse20 5) 29) .cse2) (< .cse21 0) (= (mod .cse20 5) 0) (not (< (+ (div .cse21 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse22 (* 9 v_~a29~0_899))) (let ((.cse24 (div .cse22 50))) (let ((.cse23 (mod .cse24 29))) (and (= (mod (div (+ (div .cse22 10) 1) 5) 29) 0) (<= .cse23 .cse2) (= 0 .cse23) (= (mod .cse22 10) 0) (not (< (+ .cse24 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse26 (div (* 9 v_~a29~0_899) 50))) (let ((.cse25 (mod .cse26 29))) (and (<= .cse25 .cse2) (= 0 .cse25) (not (< (+ .cse26 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse29 (* 9 v_~a29~0_899))) (let ((.cse27 (div .cse29 50)) (.cse28 (div (+ (div .cse29 10) 1) 5))) (and (= (mod (+ .cse27 1) 29) 0) (<= (mod .cse27 29) .cse2) (= (mod (+ .cse28 1) 29) 0) (= (mod .cse29 10) 0) (not (< .cse28 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse33 (* 9 v_~a29~0_899))) (let ((.cse30 (div .cse33 10))) (let ((.cse31 (div .cse33 50)) (.cse32 (div (+ .cse30 1) 5))) (and (= (mod .cse30 5) 0) (= (mod (+ .cse31 1) 29) 0) (= (mod (+ .cse32 1) 29) 0) (<= (mod .cse31 29) .cse8) (= (mod .cse33 10) 0) (< .cse32 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse35 (* 9 v_~a29~0_899))) (let ((.cse34 (div .cse35 10))) (let ((.cse36 (div (+ .cse34 1) 5))) (and (= (mod .cse34 5) 0) (<= (mod (div .cse35 50) 29) .cse2) (= (mod (+ .cse36 1) 29) 0) (not (< .cse36 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse39 (* 9 v_~a29~0_899))) (let ((.cse37 (div .cse39 50)) (.cse38 (div (+ (div .cse39 10) 1) 5))) (and (= (mod (+ .cse37 1) 29) 0) (<= (mod .cse37 29) .cse2) (= (mod (+ .cse38 1) 29) 0) (not (< .cse38 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse41 (* 9 v_~a29~0_899))) (let ((.cse40 (div (+ (div .cse41 10) 1) 5))) (and (= (mod .cse40 29) 0) (<= (mod (div .cse41 50) 29) .cse2) (= (mod .cse41 10) 0) (<= 0 (+ .cse40 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse43 (* 9 v_~a29~0_899))) (let ((.cse42 (div .cse43 50))) (and (= (mod (+ .cse42 1) 29) 0) (<= (mod .cse42 29) .cse2) (not (< (div .cse43 10) 0)) (= (mod .cse43 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse46 (* 9 v_~a29~0_899))) (let ((.cse45 (div .cse46 50)) (.cse44 (div .cse46 10))) (and (= (mod (div (+ .cse44 1) 5) 29) 0) (= (mod (+ .cse45 1) 29) 0) (<= (mod .cse45 29) .cse2) (not (< .cse44 0)) (= (mod .cse46 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse47 (* 9 v_~a29~0_899))) (let ((.cse49 (div .cse47 50))) (let ((.cse48 (mod .cse49 29))) (and (= (mod (div (+ (div .cse47 10) 1) 5) 29) 0) (<= .cse48 .cse2) (= 0 .cse48) (not (< (+ .cse49 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse50 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse52 (div .cse50 5))) (let ((.cse51 (+ .cse52 1))) (and (not (= (mod .cse50 5) 0)) (not (< .cse51 0)) (< .cse52 0) (<= (mod .cse51 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse56 (* 9 v_~a29~0_899))) (let ((.cse54 (div .cse56 50))) (let ((.cse53 (div .cse56 10)) (.cse55 (+ .cse54 1))) (and (not (= (mod .cse53 5) 0)) (not (= (mod (div (+ .cse53 1) 5) 29) 0)) (= 0 (mod .cse54 29)) (<= (mod .cse55 29) .cse8) (= (mod .cse56 10) 0) (< .cse55 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse58 (* 9 v_~a29~0_899))) (let ((.cse57 (div (+ (div .cse58 10) 1) 5)) (.cse59 (div .cse58 50))) (and (= (mod .cse57 29) 0) (not (= (mod .cse58 10) 0)) (<= (mod (+ .cse57 1) 29) .cse8) (= 0 (mod .cse59 29)) (< (+ .cse59 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse62 (* 9 v_~a29~0_899))) (let ((.cse60 (div .cse62 50))) (let ((.cse63 (+ .cse60 1))) (let ((.cse61 (mod .cse63 29))) (and (not (= 0 (mod .cse60 29))) (not (= .cse61 0)) (= (mod (+ (div (+ (div .cse62 10) 1) 5) 1) 29) 0) (<= .cse61 .cse8) (= (mod .cse62 10) 0) (< .cse63 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse67 (* 9 v_~a29~0_899))) (let ((.cse64 (div .cse67 50))) (let ((.cse66 (div (+ (div .cse67 10) 1) 5)) (.cse65 (+ .cse64 1))) (and (not (= 0 (mod .cse64 29))) (not (= (mod .cse65 29) 0)) (= (mod .cse66 29) 0) (<= (mod (+ .cse66 1) 29) .cse8) (< .cse65 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse68 (* 9 v_~a29~0_899))) (let ((.cse69 (div .cse68 50))) (and (= (mod (div .cse68 10) 5) 0) (<= (mod .cse69 29) .cse2) (<= 0 .cse69) (= (mod .cse68 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse70 (* 9 v_~a29~0_899))) (let ((.cse71 (div .cse70 50))) (and (= (mod (div .cse70 10) 5) 0) (= (mod (+ .cse71 1) 29) 0) (<= (mod .cse71 29) .cse2) (not (< .cse71 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse72 (* 9 v_~a29~0_899))) (let ((.cse73 (+ (div .cse72 10) 1)) (.cse74 (div .cse72 50))) (and (not (= (mod .cse72 10) 0)) (<= (mod (div .cse73 5) 29) .cse8) (= 0 (mod .cse74 29)) (= (mod .cse73 5) 0) (< (+ .cse74 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse76 (* 9 v_~a29~0_899))) (let ((.cse75 (div .cse76 50))) (and (<= (mod .cse75 29) .cse2) (= (mod (+ (div (+ (div .cse76 10) 1) 5) 1) 29) 0) (<= 0 .cse75))))) (exists ((v_~a29~0_899 Int)) (let ((.cse78 (* 9 v_~a29~0_899))) (let ((.cse77 (div .cse78 50))) (and (<= (mod .cse77 29) .cse2) (= (mod (+ (div (+ (div .cse78 10) 1) 5) 1) 29) 0) (<= 0 .cse77) (= (mod .cse78 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse79 (* 9 v_~a29~0_899))) (let ((.cse81 (div (+ (div .cse79 10) 1) 5))) (let ((.cse80 (mod (+ .cse81 1) 29))) (and (= (mod (+ (div .cse79 50) 1) 29) 0) (not (= (mod .cse79 10) 0)) (= .cse80 0) (< .cse81 0) (<= .cse80 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse83 (* 9 v_~a29~0_899))) (let ((.cse82 (div .cse83 50))) (and (= (mod (+ .cse82 1) 29) 0) (<= (mod .cse82 29) .cse2) (not (< (div .cse83 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse86 (* 9 v_~a29~0_899))) (let ((.cse84 (div .cse86 10)) (.cse85 (div .cse86 50))) (and (= (mod .cse84 5) 0) (<= (mod .cse85 29) .cse2) (= (mod (+ (div (+ .cse84 1) 5) 1) 29) 0) (<= 0 .cse85))))) (exists ((v_~a29~0_899 Int)) (let ((.cse88 (* 9 v_~a29~0_899))) (let ((.cse91 (+ (div .cse88 10) 1))) (let ((.cse90 (div .cse91 5))) (let ((.cse89 (mod .cse90 29)) (.cse87 (div .cse88 50))) (and (not (= 0 (mod .cse87 29))) (not (= (mod .cse88 10) 0)) (not (= .cse89 0)) (<= .cse89 .cse8) (not (= (mod (+ .cse90 1) 29) 0)) (= (mod .cse91 5) 0) (< (+ .cse87 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse92 (* 9 v_~a29~0_899))) (let ((.cse93 (div .cse92 50))) (and (= (mod (div (+ (div .cse92 10) 1) 5) 29) 0) (<= (mod .cse93 29) .cse2) (<= 0 .cse93))))) (exists ((v_~a29~0_899 Int)) (let ((.cse94 (* 9 v_~a29~0_899))) (let ((.cse96 (div .cse94 50))) (let ((.cse95 (mod .cse96 29))) (and (= (mod (div .cse94 10) 5) 0) (<= .cse95 .cse2) (= 0 .cse95) (not (< (+ .cse96 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse98 (* 9 v_~a29~0_899))) (let ((.cse97 (div (+ (div .cse98 10) 1) 5))) (and (<= 0 .cse97) (<= (mod .cse97 29) .cse2) (< .cse98 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse101 (* 9 v_~a29~0_899))) (let ((.cse99 (div .cse101 10)) (.cse100 (mod (+ (div .cse101 50) 1) 29))) (and (= (mod (div (+ .cse99 1) 5) 29) 0) (= .cse100 0) (= (mod .cse101 10) 0) (< .cse99 0) (<= .cse100 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse103 (* 9 v_~a29~0_899))) (let ((.cse102 (mod (div (+ (div .cse103 10) 1) 5) 29))) (and (= .cse102 0) (<= .cse102 .cse2) (< .cse103 0) (not (< (+ (div .cse103 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse106 (* 9 v_~a29~0_899))) (let ((.cse105 (div .cse106 50)) (.cse104 (div .cse106 10))) (and (= (mod .cse104 5) 0) (= (mod (+ .cse105 1) 29) 0) (<= (mod .cse105 29) .cse2) (= (mod .cse106 10) 0) (not (< (div (+ .cse104 1) 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse107 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse107 29) .cse2) (<= 0 .cse107)))) (exists ((v_~a29~0_899 Int)) (let ((.cse108 (* 9 v_~a29~0_899))) (and (= (mod (+ (div (+ (div .cse108 10) 1) 5) 1) 29) 0) (= 0 (mod (div .cse108 50) 29))))) (exists ((v_~a29~0_899 Int)) (let ((.cse112 (* 9 v_~a29~0_899))) (let ((.cse110 (div .cse112 10))) (let ((.cse111 (div (+ .cse110 1) 5)) (.cse109 (mod (+ (div .cse112 50) 1) 29))) (and (= .cse109 0) (not (= (mod .cse110 5) 0)) (= (mod (+ .cse111 1) 29) 0) (= (mod .cse112 10) 0) (< .cse111 0) (<= .cse109 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse113 (* 9 v_~a29~0_899))) (let ((.cse115 (div .cse113 50))) (let ((.cse114 (mod .cse115 29))) (and (= (mod (div .cse113 10) 5) 0) (<= .cse114 .cse2) (= 0 .cse114) (= (mod .cse113 10) 0) (< (+ .cse115 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse118 (* 9 v_~a29~0_899))) (let ((.cse116 (div .cse118 50))) (let ((.cse119 (+ .cse116 1))) (let ((.cse117 (mod .cse119 29))) (and (not (= 0 (mod .cse116 29))) (not (= .cse117 0)) (= (mod (div (+ (div .cse118 10) 1) 5) 29) 0) (<= .cse117 .cse8) (= (mod .cse118 10) 0) (< .cse119 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse123 (* 9 v_~a29~0_899))) (let ((.cse121 (div .cse123 50))) (let ((.cse120 (div .cse123 10)) (.cse122 (+ .cse121 1))) (and (= (mod (div (+ .cse120 1) 5) 29) 0) (not (= (mod .cse120 5) 0)) (= 0 (mod .cse121 29)) (<= (mod .cse122 29) .cse8) (= (mod .cse123 10) 0) (< .cse122 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse125 (* 9 v_~a29~0_899))) (let ((.cse126 (div .cse125 50))) (let ((.cse124 (mod .cse126 29))) (and (<= .cse124 .cse2) (= 0 .cse124) (= (mod .cse125 10) 0) (not (< (+ .cse126 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse127 (* 9 v_~a29~0_899))) (let ((.cse128 (div .cse127 50))) (and (= (mod (div .cse127 10) 5) 0) (= (mod (+ .cse128 1) 29) 0) (<= (mod .cse128 29) .cse2) (not (< .cse128 0)) (= (mod .cse127 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse131 (* 9 v_~a29~0_899))) (let ((.cse130 (div (+ (div .cse131 10) 1) 5))) (let ((.cse129 (mod .cse130 29))) (and (= .cse129 0) (not (< (+ .cse130 1) 0)) (<= .cse129 .cse2) (< .cse131 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse135 (* 9 v_~a29~0_899))) (let ((.cse133 (div .cse135 10))) (let ((.cse134 (div (+ .cse133 1) 5)) (.cse132 (mod (+ (div .cse135 50) 1) 29))) (and (= .cse132 0) (not (= (mod .cse133 5) 0)) (not (= (mod .cse134 29) 0)) (= (mod .cse135 10) 0) (not (= (mod (+ .cse134 1) 29) 0)) (< .cse133 0) (<= .cse132 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse137 (* 9 v_~a29~0_899))) (let ((.cse136 (div (+ (div .cse137 10) 1) 5))) (and (< .cse136 0) (<= (mod (+ .cse136 1) 29) .cse2) (not (< (+ (div .cse137 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse138 (* 9 v_~a29~0_899))) (let ((.cse140 (+ (div .cse138 10) 1))) (let ((.cse139 (div .cse140 5))) (and (= (mod (+ (div .cse138 50) 1) 29) 0) (not (= (mod .cse138 10) 0)) (< (+ .cse139 1) 0) (<= (mod .cse139 29) .cse2) (= (mod .cse140 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse142 (* 9 v_~a29~0_899))) (let ((.cse141 (div (+ (div .cse142 10) 1) 5))) (and (not (< (+ .cse141 1) 0)) (<= (mod .cse141 29) .cse8) (< (+ (div .cse142 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse144 (+ (div .cse143 10) 1))) (let ((.cse145 (div .cse144 5))) (let ((.cse146 (mod (+ .cse145 1) 29))) (and (= (mod (+ (div .cse143 50) 1) 29) 0) (not (= (mod .cse143 10) 0)) (not (= (mod .cse144 5) 0)) (not (= (mod .cse145 29) 0)) (<= .cse146 .cse8) (not (= .cse146 0)) (< .cse143 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse150 (* 9 v_~a29~0_899))) (let ((.cse147 (div .cse150 10))) (let ((.cse148 (div (+ .cse147 1) 5)) (.cse149 (div .cse150 50))) (and (= (mod .cse147 5) 0) (not (= (mod .cse148 29) 0)) (<= (mod .cse149 29) .cse8) (= (mod .cse150 10) 0) (not (= (mod (+ .cse148 1) 29) 0)) (< (+ .cse149 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse153 (* 9 v_~a29~0_899))) (let ((.cse152 (div .cse153 50)) (.cse151 (div .cse153 10))) (and (= (mod (div (+ .cse151 1) 5) 29) 0) (= (mod (+ .cse152 1) 29) 0) (<= (mod .cse152 29) .cse2) (not (< .cse151 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse156 (* 9 v_~a29~0_899))) (let ((.cse154 (div .cse156 10)) (.cse155 (div .cse156 50))) (and (= (mod .cse154 5) 0) (<= (mod .cse155 29) .cse2) (= (mod (+ (div (+ .cse154 1) 5) 1) 29) 0) (<= 0 .cse155) (= (mod .cse156 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse158 (* 9 v_~a29~0_899))) (let ((.cse157 (+ (div .cse158 10) 1))) (and (not (< .cse157 0)) (<= (mod (div .cse157 5) 29) .cse2) (< .cse158 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse159 (* 9 v_~a29~0_899))) (let ((.cse161 (div .cse159 50))) (let ((.cse160 (mod .cse161 29))) (and (= (mod (div .cse159 10) 5) 0) (<= .cse160 .cse2) (= 0 .cse160) (= (mod .cse159 10) 0) (not (< (+ .cse161 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse163 (* 9 v_~a29~0_899))) (let ((.cse162 (div .cse163 50))) (and (<= (mod .cse162 29) .cse2) (<= 0 .cse162) (= (mod .cse163 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse166 (* 9 v_~a29~0_899))) (let ((.cse167 (+ (div .cse166 10) 1))) (let ((.cse164 (div .cse166 50)) (.cse168 (div .cse167 5))) (let ((.cse169 (mod (+ .cse168 1) 29)) (.cse165 (+ .cse164 1))) (and (not (= 0 (mod .cse164 29))) (not (= (mod .cse165 29) 0)) (not (= (mod .cse166 10) 0)) (not (= (mod .cse167 5) 0)) (not (= (mod .cse168 29) 0)) (<= .cse169 .cse8) (not (= .cse169 0)) (< .cse165 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse170 (* 9 v_~a29~0_899))) (let ((.cse171 (div .cse170 50))) (and (= (mod (div .cse170 10) 5) 0) (<= (mod .cse171 29) .cse2) (<= 0 .cse171))))))) is different from true [2022-11-16 11:53:54,196 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 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 ((.cse6 (* 9 v_~a29~0_899))) (let ((.cse4 (div .cse6 50))) (let ((.cse8 (+ .cse4 1))) (let ((.cse5 (mod .cse8 29))) (and (not (= 0 (mod .cse4 29))) (not (= .cse5 0)) (= (mod (div (+ (div .cse6 10) 1) 5) 29) 0) (<= .cse5 .cse7) (< .cse8 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse9 (div .cse13 50)) (.cse10 (div .cse13 10))) (let ((.cse11 (div (+ .cse10 1) 5)) (.cse12 (+ .cse9 1))) (and (not (= 0 (mod .cse9 29))) (not (= (mod .cse10 5) 0)) (not (= (mod .cse11 29) 0)) (<= (mod .cse12 29) .cse7) (= (mod .cse13 10) 0) (not (= (mod (+ .cse11 1) 29) 0)) (< .cse12 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse14 (* 9 v_~a29~0_899))) (let ((.cse16 (+ (div .cse14 10) 1))) (let ((.cse15 (div .cse16 5))) (and (not (= (mod .cse14 10) 0)) (= (mod (+ .cse15 1) 29) 0) (<= (mod .cse15 29) .cse7) (= (mod .cse16 5) 0) (< (+ (div .cse14 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse19 (* 9 v_~a29~0_899))) (let ((.cse17 (div .cse19 10))) (let ((.cse18 (div (+ .cse17 1) 5))) (and (= (mod .cse17 5) 0) (= (mod .cse18 29) 0) (<= (mod (div .cse19 50) 29) .cse2) (= (mod .cse19 10) 0) (<= 0 (+ .cse18 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse22 (* 9 v_~a29~0_899))) (let ((.cse20 (div .cse22 10))) (let ((.cse21 (div (+ .cse20 1) 5))) (and (= (mod .cse20 5) 0) (= (mod .cse21 29) 0) (<= (mod (div .cse22 50) 29) .cse2) (<= 0 (+ .cse21 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse24 (* 9 v_~a29~0_899))) (let ((.cse23 (+ (div .cse24 10) 1))) (and (<= (mod (div .cse23 5) 29) .cse2) (< .cse24 0) (= (mod .cse23 5) 0) (not (< (+ (div .cse24 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse25 (* 9 v_~a29~0_899))) (let ((.cse27 (div .cse25 50))) (let ((.cse26 (mod .cse27 29))) (and (= (mod (div (+ (div .cse25 10) 1) 5) 29) 0) (<= .cse26 .cse2) (= 0 .cse26) (= (mod .cse25 10) 0) (not (< (+ .cse27 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse29 (div (* 9 v_~a29~0_899) 50))) (let ((.cse28 (mod .cse29 29))) (and (<= .cse28 .cse2) (= 0 .cse28) (not (< (+ .cse29 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse32 (* 9 v_~a29~0_899))) (let ((.cse30 (div .cse32 50)) (.cse31 (div (+ (div .cse32 10) 1) 5))) (and (= (mod (+ .cse30 1) 29) 0) (<= (mod .cse30 29) .cse2) (= (mod (+ .cse31 1) 29) 0) (= (mod .cse32 10) 0) (not (< .cse31 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse34 (* 9 v_~a29~0_899))) (let ((.cse33 (div .cse34 10))) (let ((.cse35 (div (+ .cse33 1) 5))) (and (= (mod .cse33 5) 0) (<= (mod (div .cse34 50) 29) .cse2) (= (mod (+ .cse35 1) 29) 0) (not (< .cse35 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 ((.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) .cse7) (= (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) .cse7) (= 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 .cse7) (= (mod .cse60 10) 0) (< .cse61 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse65 (* 9 v_~a29~0_899))) (let ((.cse62 (div .cse65 50))) (let ((.cse64 (div (+ (div .cse65 10) 1) 5)) (.cse63 (+ .cse62 1))) (and (not (= 0 (mod .cse62 29))) (not (= (mod .cse63 29) 0)) (= (mod .cse64 29) 0) (<= (mod (+ .cse64 1) 29) .cse7) (< .cse63 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse66 (* 9 v_~a29~0_899))) (let ((.cse67 (div .cse66 50))) (and (= (mod (div .cse66 10) 5) 0) (<= (mod .cse67 29) .cse2) (<= 0 .cse67) (= (mod .cse66 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse68 (* 9 v_~a29~0_899))) (let ((.cse69 (div .cse68 50))) (and (= (mod (div .cse68 10) 5) 0) (= (mod (+ .cse69 1) 29) 0) (<= (mod .cse69 29) .cse2) (not (< .cse69 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse70 (* 9 v_~a29~0_899))) (let ((.cse71 (+ (div .cse70 10) 1)) (.cse72 (div .cse70 50))) (and (not (= (mod .cse70 10) 0)) (<= (mod (div .cse71 5) 29) .cse7) (= 0 (mod .cse72 29)) (= (mod .cse71 5) 0) (< (+ .cse72 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse74 (* 9 v_~a29~0_899))) (let ((.cse73 (div .cse74 50))) (and (<= (mod .cse73 29) .cse2) (= (mod (+ (div (+ (div .cse74 10) 1) 5) 1) 29) 0) (<= 0 .cse73))))) (exists ((v_~a29~0_899 Int)) (let ((.cse76 (* 9 v_~a29~0_899))) (let ((.cse75 (div .cse76 50))) (and (<= (mod .cse75 29) .cse2) (= (mod (+ (div (+ (div .cse76 10) 1) 5) 1) 29) 0) (<= 0 .cse75) (= (mod .cse76 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse77 (* 9 v_~a29~0_899))) (let ((.cse79 (div (+ (div .cse77 10) 1) 5))) (let ((.cse78 (mod (+ .cse79 1) 29))) (and (= (mod (+ (div .cse77 50) 1) 29) 0) (not (= (mod .cse77 10) 0)) (= .cse78 0) (< .cse79 0) (<= .cse78 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse81 (* 9 v_~a29~0_899))) (let ((.cse80 (div .cse81 50))) (and (= (mod (+ .cse80 1) 29) 0) (<= (mod .cse80 29) .cse2) (not (< (div .cse81 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse84 (* 9 v_~a29~0_899))) (let ((.cse82 (div .cse84 10)) (.cse83 (div .cse84 50))) (and (= (mod .cse82 5) 0) (<= (mod .cse83 29) .cse2) (= (mod (+ (div (+ .cse82 1) 5) 1) 29) 0) (<= 0 .cse83))))) (exists ((v_~a29~0_899 Int)) (let ((.cse86 (* 9 v_~a29~0_899))) (let ((.cse89 (+ (div .cse86 10) 1))) (let ((.cse88 (div .cse89 5))) (let ((.cse87 (mod .cse88 29)) (.cse85 (div .cse86 50))) (and (not (= 0 (mod .cse85 29))) (not (= (mod .cse86 10) 0)) (not (= .cse87 0)) (<= .cse87 .cse7) (not (= (mod (+ .cse88 1) 29) 0)) (= (mod .cse89 5) 0) (< (+ .cse85 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse90 (* 9 v_~a29~0_899))) (let ((.cse91 (div .cse90 50))) (and (= (mod (div (+ (div .cse90 10) 1) 5) 29) 0) (<= (mod .cse91 29) .cse2) (<= 0 .cse91))))) (exists ((v_~a29~0_899 Int)) (let ((.cse92 (* 9 v_~a29~0_899))) (let ((.cse94 (div .cse92 50))) (let ((.cse93 (mod .cse94 29))) (and (= (mod (div .cse92 10) 5) 0) (<= .cse93 .cse2) (= 0 .cse93) (not (< (+ .cse94 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse96 (* 9 v_~a29~0_899))) (let ((.cse95 (div (+ (div .cse96 10) 1) 5))) (and (<= 0 .cse95) (<= (mod .cse95 29) .cse2) (< .cse96 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse99 (* 9 v_~a29~0_899))) (let ((.cse97 (div .cse99 10)) (.cse98 (mod (+ (div .cse99 50) 1) 29))) (and (= (mod (div (+ .cse97 1) 5) 29) 0) (= .cse98 0) (= (mod .cse99 10) 0) (< .cse97 0) (<= .cse98 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse101 (* 9 v_~a29~0_899))) (let ((.cse100 (mod (div (+ (div .cse101 10) 1) 5) 29))) (and (= .cse100 0) (<= .cse100 .cse2) (< .cse101 0) (not (< (+ (div .cse101 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse104 (* 9 v_~a29~0_899))) (let ((.cse103 (div .cse104 50)) (.cse102 (div .cse104 10))) (and (= (mod .cse102 5) 0) (= (mod (+ .cse103 1) 29) 0) (<= (mod .cse103 29) .cse2) (= (mod .cse104 10) 0) (not (< (div (+ .cse102 1) 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse105 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse105 29) .cse2) (<= 0 .cse105)))) (exists ((v_~a29~0_899 Int)) (let ((.cse109 (* 9 v_~a29~0_899))) (let ((.cse107 (div .cse109 10))) (let ((.cse108 (div (+ .cse107 1) 5)) (.cse106 (mod (+ (div .cse109 50) 1) 29))) (and (= .cse106 0) (not (= (mod .cse107 5) 0)) (= (mod (+ .cse108 1) 29) 0) (= (mod .cse109 10) 0) (< .cse108 0) (<= .cse106 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse110 (* 9 v_~a29~0_899))) (let ((.cse112 (div .cse110 50))) (let ((.cse111 (mod .cse112 29))) (and (= (mod (div .cse110 10) 5) 0) (<= .cse111 .cse2) (= 0 .cse111) (= (mod .cse110 10) 0) (< (+ .cse112 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse116 (* 9 v_~a29~0_899))) (let ((.cse114 (div .cse116 50))) (let ((.cse113 (div .cse116 10)) (.cse115 (+ .cse114 1))) (and (= (mod (div (+ .cse113 1) 5) 29) 0) (not (= (mod .cse113 5) 0)) (= 0 (mod .cse114 29)) (<= (mod .cse115 29) .cse7) (= (mod .cse116 10) 0) (< .cse115 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse118 (* 9 v_~a29~0_899))) (let ((.cse119 (div .cse118 50))) (let ((.cse117 (mod .cse119 29))) (and (<= .cse117 .cse2) (= 0 .cse117) (= (mod .cse118 10) 0) (not (< (+ .cse119 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse120 (* 9 v_~a29~0_899))) (let ((.cse121 (div .cse120 50))) (let ((.cse122 (+ .cse121 1))) (and (not (= (mod (div (+ (div .cse120 10) 1) 5) 29) 0)) (= 0 (mod .cse121 29)) (<= (mod .cse122 29) .cse7) (= (mod .cse120 10) 0) (< .cse122 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse123 (* 9 v_~a29~0_899))) (let ((.cse124 (div .cse123 50))) (and (= (mod (div .cse123 10) 5) 0) (= (mod (+ .cse124 1) 29) 0) (<= (mod .cse124 29) .cse2) (not (< .cse124 0)) (= (mod .cse123 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse127 (* 9 v_~a29~0_899))) (let ((.cse126 (div (+ (div .cse127 10) 1) 5))) (let ((.cse125 (mod .cse126 29))) (and (= .cse125 0) (not (< (+ .cse126 1) 0)) (<= .cse125 .cse2) (< .cse127 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse129 (* 9 v_~a29~0_899))) (let ((.cse128 (div (+ (div .cse129 10) 1) 5))) (and (< .cse128 0) (<= (mod (+ .cse128 1) 29) .cse2) (not (< (+ (div .cse129 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse130 (* 9 v_~a29~0_899))) (let ((.cse132 (+ (div .cse130 10) 1))) (let ((.cse131 (div .cse132 5))) (and (= (mod (+ (div .cse130 50) 1) 29) 0) (not (= (mod .cse130 10) 0)) (< (+ .cse131 1) 0) (<= (mod .cse131 29) .cse2) (= (mod .cse132 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse134 (* 9 v_~a29~0_899))) (let ((.cse133 (div (+ (div .cse134 10) 1) 5))) (and (not (< (+ .cse133 1) 0)) (<= (mod .cse133 29) .cse7) (< (+ (div .cse134 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse138 (* 9 v_~a29~0_899))) (let ((.cse135 (div .cse138 10))) (let ((.cse136 (div (+ .cse135 1) 5)) (.cse137 (div .cse138 50))) (and (= (mod .cse135 5) 0) (not (= (mod .cse136 29) 0)) (<= (mod .cse137 29) .cse7) (= (mod .cse138 10) 0) (not (= (mod (+ .cse136 1) 29) 0)) (< (+ .cse137 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse141 (* 9 v_~a29~0_899))) (let ((.cse140 (div .cse141 50)) (.cse139 (div .cse141 10))) (and (= (mod (div (+ .cse139 1) 5) 29) 0) (= (mod (+ .cse140 1) 29) 0) (<= (mod .cse140 29) .cse2) (not (< .cse139 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse144 (* 9 v_~a29~0_899))) (let ((.cse142 (div .cse144 10)) (.cse143 (div .cse144 50))) (and (= (mod .cse142 5) 0) (<= (mod .cse143 29) .cse2) (= (mod (+ (div (+ .cse142 1) 5) 1) 29) 0) (<= 0 .cse143) (= (mod .cse144 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse146 (* 9 v_~a29~0_899))) (let ((.cse145 (+ (div .cse146 10) 1))) (and (not (< .cse145 0)) (<= (mod (div .cse145 5) 29) .cse2) (< .cse146 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse147 (* 9 v_~a29~0_899))) (let ((.cse149 (div .cse147 50))) (let ((.cse148 (mod .cse149 29))) (and (= (mod (div .cse147 10) 5) 0) (<= .cse148 .cse2) (= 0 .cse148) (= (mod .cse147 10) 0) (not (< (+ .cse149 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse151 (* 9 v_~a29~0_899))) (let ((.cse150 (div .cse151 50))) (and (<= (mod .cse150 29) .cse2) (<= 0 .cse150) (= (mod .cse151 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse154 (* 9 v_~a29~0_899))) (let ((.cse155 (+ (div .cse154 10) 1))) (let ((.cse152 (div .cse154 50)) (.cse156 (div .cse155 5))) (let ((.cse157 (mod (+ .cse156 1) 29)) (.cse153 (+ .cse152 1))) (and (not (= 0 (mod .cse152 29))) (not (= (mod .cse153 29) 0)) (not (= (mod .cse154 10) 0)) (not (= (mod .cse155 5) 0)) (not (= (mod .cse156 29) 0)) (<= .cse157 .cse7) (not (= .cse157 0)) (< .cse153 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse158 (* 9 v_~a29~0_899))) (let ((.cse159 (div .cse158 50))) (and (= (mod (div .cse158 10) 5) 0) (<= (mod .cse159 29) .cse2) (<= 0 .cse159))))))) is different from true [2022-11-16 11:54:51,031 WARN L855 $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 ((.cse30 (* 9 v_~a29~0_899))) (let ((.cse29 (div .cse30 10))) (let ((.cse31 (div (+ .cse29 1) 5))) (and (= (mod .cse29 5) 0) (<= (mod (div .cse30 50) 29) .cse2) (= (mod (+ .cse31 1) 29) 0) (not (< .cse31 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 ((.cse50 (* 9 v_~a29~0_899))) (let ((.cse48 (div .cse50 10))) (let ((.cse49 (div (+ .cse48 1) 5))) (and (= (mod .cse48 5) 0) (= (mod (+ .cse49 1) 29) 0) (<= (mod (div .cse50 50) 29) .cse8) (= (mod .cse50 10) 0) (< .cse49 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse52 (* 9 v_~a29~0_899))) (let ((.cse51 (div (+ (div .cse52 10) 1) 5)) (.cse53 (div .cse52 50))) (and (= (mod .cse51 29) 0) (not (= (mod .cse52 10) 0)) (<= (mod (+ .cse51 1) 29) .cse8) (= 0 (mod .cse53 29)) (< (+ .cse53 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse56 (* 9 v_~a29~0_899))) (let ((.cse54 (div .cse56 50))) (let ((.cse57 (+ .cse54 1))) (let ((.cse55 (mod .cse57 29))) (and (not (= 0 (mod .cse54 29))) (not (= .cse55 0)) (= (mod (+ (div (+ (div .cse56 10) 1) 5) 1) 29) 0) (<= .cse55 .cse8) (= (mod .cse56 10) 0) (< .cse57 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse61 (* 9 v_~a29~0_899))) (let ((.cse58 (div .cse61 50))) (let ((.cse60 (div (+ (div .cse61 10) 1) 5)) (.cse59 (+ .cse58 1))) (and (not (= 0 (mod .cse58 29))) (not (= (mod .cse59 29) 0)) (= (mod .cse60 29) 0) (<= (mod (+ .cse60 1) 29) .cse8) (< .cse59 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 ((.cse88 (* 9 v_~a29~0_899))) (let ((.cse90 (div .cse88 50))) (let ((.cse89 (mod .cse90 29))) (and (= (mod (div .cse88 10) 5) 0) (<= .cse89 .cse2) (= 0 .cse89) (not (< (+ .cse90 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse92 (* 9 v_~a29~0_899))) (let ((.cse91 (div (+ (div .cse92 10) 1) 5))) (and (<= 0 .cse91) (<= (mod .cse91 29) .cse2) (< .cse92 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse95 (* 9 v_~a29~0_899))) (let ((.cse93 (div .cse95 10)) (.cse94 (mod (+ (div .cse95 50) 1) 29))) (and (= (mod (div (+ .cse93 1) 5) 29) 0) (= .cse94 0) (= (mod .cse95 10) 0) (< .cse93 0) (<= .cse94 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse97 (* 9 v_~a29~0_899))) (let ((.cse96 (mod (div (+ (div .cse97 10) 1) 5) 29))) (and (= .cse96 0) (<= .cse96 .cse2) (< .cse97 0) (not (< (+ (div .cse97 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse100 (* 9 v_~a29~0_899))) (let ((.cse99 (div .cse100 50)) (.cse98 (div .cse100 10))) (and (= (mod .cse98 5) 0) (= (mod (+ .cse99 1) 29) 0) (<= (mod .cse99 29) .cse2) (= (mod .cse100 10) 0) (not (< (div (+ .cse98 1) 5) 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 ((.cse112 (* 9 v_~a29~0_899))) (let ((.cse110 (div .cse112 50))) (let ((.cse109 (div .cse112 10)) (.cse111 (+ .cse110 1))) (and (= (mod (div (+ .cse109 1) 5) 29) 0) (not (= (mod .cse109 5) 0)) (= 0 (mod .cse110 29)) (<= (mod .cse111 29) .cse8) (= (mod .cse112 10) 0) (< .cse111 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse114 (* 9 v_~a29~0_899))) (let ((.cse115 (div .cse114 50))) (let ((.cse113 (mod .cse115 29))) (and (<= .cse113 .cse2) (= 0 .cse113) (= (mod .cse114 10) 0) (not (< (+ .cse115 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse116 (* 9 v_~a29~0_899))) (let ((.cse117 (div .cse116 50))) (let ((.cse118 (+ .cse117 1))) (and (not (= (mod (div (+ (div .cse116 10) 1) 5) 29) 0)) (= 0 (mod .cse117 29)) (<= (mod .cse118 29) .cse8) (= (mod .cse116 10) 0) (< .cse118 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse119 (* 9 v_~a29~0_899))) (let ((.cse120 (div .cse119 50))) (and (= (mod (div .cse119 10) 5) 0) (= (mod (+ .cse120 1) 29) 0) (<= (mod .cse120 29) .cse2) (not (< .cse120 0)) (= (mod .cse119 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse123 (* 9 v_~a29~0_899))) (let ((.cse122 (div (+ (div .cse123 10) 1) 5))) (let ((.cse121 (mod .cse122 29))) (and (= .cse121 0) (not (< (+ .cse122 1) 0)) (<= .cse121 .cse2) (< .cse123 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse125 (* 9 v_~a29~0_899))) (let ((.cse124 (div (+ (div .cse125 10) 1) 5))) (and (< .cse124 0) (<= (mod (+ .cse124 1) 29) .cse2) (not (< (+ (div .cse125 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse128 (+ (div .cse126 10) 1))) (let ((.cse127 (div .cse128 5))) (and (= (mod (+ (div .cse126 50) 1) 29) 0) (not (= (mod .cse126 10) 0)) (< (+ .cse127 1) 0) (<= (mod .cse127 29) .cse2) (= (mod .cse128 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse130 (* 9 v_~a29~0_899))) (let ((.cse129 (div (+ (div .cse130 10) 1) 5))) (and (not (< (+ .cse129 1) 0)) (<= (mod .cse129 29) .cse8) (< (+ (div .cse130 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse134 (* 9 v_~a29~0_899))) (let ((.cse131 (div .cse134 10))) (let ((.cse132 (div (+ .cse131 1) 5)) (.cse133 (div .cse134 50))) (and (= (mod .cse131 5) 0) (not (= (mod .cse132 29) 0)) (<= (mod .cse133 29) .cse8) (= (mod .cse134 10) 0) (not (= (mod (+ .cse132 1) 29) 0)) (< (+ .cse133 1) 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 ((.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 ((.cse150 (* 9 v_~a29~0_899))) (let ((.cse151 (+ (div .cse150 10) 1))) (let ((.cse148 (div .cse150 50)) (.cse152 (div .cse151 5))) (let ((.cse153 (mod (+ .cse152 1) 29)) (.cse149 (+ .cse148 1))) (and (not (= 0 (mod .cse148 29))) (not (= (mod .cse149 29) 0)) (not (= (mod .cse150 10) 0)) (not (= (mod .cse151 5) 0)) (not (= (mod .cse152 29) 0)) (<= .cse153 .cse8) (not (= .cse153 0)) (< .cse149 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse154 (* 9 v_~a29~0_899))) (let ((.cse155 (div .cse154 50))) (and (= (mod (div .cse154 10) 5) 0) (<= (mod .cse155 29) .cse2) (<= 0 .cse155))))))) is different from true [2022-11-16 11:55:55,294 WARN L855 $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 ((.cse30 (* 9 v_~a29~0_899))) (let ((.cse29 (div .cse30 10))) (let ((.cse31 (div (+ .cse29 1) 5))) (and (= (mod .cse29 5) 0) (<= (mod (div .cse30 50) 29) .cse2) (= (mod (+ .cse31 1) 29) 0) (not (< .cse31 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 ((.cse50 (* 9 v_~a29~0_899))) (let ((.cse48 (div .cse50 10))) (let ((.cse49 (div (+ .cse48 1) 5))) (and (= (mod .cse48 5) 0) (= (mod (+ .cse49 1) 29) 0) (<= (mod (div .cse50 50) 29) .cse8) (= (mod .cse50 10) 0) (< .cse49 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse52 (* 9 v_~a29~0_899))) (let ((.cse51 (div (+ (div .cse52 10) 1) 5)) (.cse53 (div .cse52 50))) (and (= (mod .cse51 29) 0) (not (= (mod .cse52 10) 0)) (<= (mod (+ .cse51 1) 29) .cse8) (= 0 (mod .cse53 29)) (< (+ .cse53 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse56 (* 9 v_~a29~0_899))) (let ((.cse54 (div .cse56 50))) (let ((.cse57 (+ .cse54 1))) (let ((.cse55 (mod .cse57 29))) (and (not (= 0 (mod .cse54 29))) (not (= .cse55 0)) (= (mod (+ (div (+ (div .cse56 10) 1) 5) 1) 29) 0) (<= .cse55 .cse8) (= (mod .cse56 10) 0) (< .cse57 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) .cse8) (= 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 .cse8) (not (= (mod (+ .cse80 1) 29) 0)) (= (mod .cse81 5) 0) (< (+ .cse77 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse84 (* 9 v_~a29~0_899))) (let ((.cse82 (div .cse84 50)) (.cse83 (div (+ (div .cse84 10) 1) 5))) (and (not (= 0 (mod .cse82 29))) (not (= (mod (+ .cse82 1) 29) 0)) (= (mod .cse83 29) 0) (<= (mod (+ .cse83 1) 29) .cse8))))) (exists ((v_~a29~0_899 Int)) (let ((.cse85 (* 9 v_~a29~0_899))) (let ((.cse86 (div .cse85 50))) (and (= (mod (div (+ (div .cse85 10) 1) 5) 29) 0) (<= (mod .cse86 29) .cse2) (<= 0 .cse86))))) (exists ((v_~a29~0_899 Int)) (let ((.cse87 (* 9 v_~a29~0_899))) (let ((.cse89 (div .cse87 50))) (let ((.cse88 (mod .cse89 29))) (and (= (mod (div .cse87 10) 5) 0) (<= .cse88 .cse2) (= 0 .cse88) (not (< (+ .cse89 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse91 (* 9 v_~a29~0_899))) (let ((.cse90 (div (+ (div .cse91 10) 1) 5))) (and (<= 0 .cse90) (<= (mod .cse90 29) .cse2) (< .cse91 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse94 (* 9 v_~a29~0_899))) (let ((.cse92 (div .cse94 10)) (.cse93 (mod (+ (div .cse94 50) 1) 29))) (and (= (mod (div (+ .cse92 1) 5) 29) 0) (= .cse93 0) (= (mod .cse94 10) 0) (< .cse92 0) (<= .cse93 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse96 (* 9 v_~a29~0_899))) (let ((.cse95 (mod (div (+ (div .cse96 10) 1) 5) 29))) (and (= .cse95 0) (<= .cse95 .cse2) (< .cse96 0) (not (< (+ (div .cse96 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse99 (* 9 v_~a29~0_899))) (let ((.cse98 (div .cse99 50)) (.cse97 (div .cse99 10))) (and (= (mod .cse97 5) 0) (= (mod (+ .cse98 1) 29) 0) (<= (mod .cse98 29) .cse2) (= (mod .cse99 10) 0) (not (< (div (+ .cse97 1) 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse100 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse100 29) .cse2) (<= 0 .cse100)))) (exists ((v_~a29~0_899 Int)) (let ((.cse104 (* 9 v_~a29~0_899))) (let ((.cse102 (div .cse104 10))) (let ((.cse103 (div (+ .cse102 1) 5)) (.cse101 (mod (+ (div .cse104 50) 1) 29))) (and (= .cse101 0) (not (= (mod .cse102 5) 0)) (= (mod (+ .cse103 1) 29) 0) (= (mod .cse104 10) 0) (< .cse103 0) (<= .cse101 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse105 (* 9 v_~a29~0_899))) (let ((.cse107 (div .cse105 50))) (let ((.cse106 (mod .cse107 29))) (and (= (mod (div .cse105 10) 5) 0) (<= .cse106 .cse2) (= 0 .cse106) (= (mod .cse105 10) 0) (< (+ .cse107 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse111 (* 9 v_~a29~0_899))) (let ((.cse109 (div .cse111 50))) (let ((.cse108 (div .cse111 10)) (.cse110 (+ .cse109 1))) (and (= (mod (div (+ .cse108 1) 5) 29) 0) (not (= (mod .cse108 5) 0)) (= 0 (mod .cse109 29)) (<= (mod .cse110 29) .cse8) (= (mod .cse111 10) 0) (< .cse110 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse113 (* 9 v_~a29~0_899))) (let ((.cse114 (div .cse113 50))) (let ((.cse112 (mod .cse114 29))) (and (<= .cse112 .cse2) (= 0 .cse112) (= (mod .cse113 10) 0) (not (< (+ .cse114 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse115 (* 9 v_~a29~0_899))) (let ((.cse116 (div .cse115 50))) (let ((.cse117 (+ .cse116 1))) (and (not (= (mod (div (+ (div .cse115 10) 1) 5) 29) 0)) (= 0 (mod .cse116 29)) (<= (mod .cse117 29) .cse8) (= (mod .cse115 10) 0) (< .cse117 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse118 (* 9 v_~a29~0_899))) (let ((.cse119 (div .cse118 50))) (and (= (mod (div .cse118 10) 5) 0) (= (mod (+ .cse119 1) 29) 0) (<= (mod .cse119 29) .cse2) (not (< .cse119 0)) (= (mod .cse118 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse122 (* 9 v_~a29~0_899))) (let ((.cse121 (div (+ (div .cse122 10) 1) 5))) (let ((.cse120 (mod .cse121 29))) (and (= .cse120 0) (not (< (+ .cse121 1) 0)) (<= .cse120 .cse2) (< .cse122 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse124 (* 9 v_~a29~0_899))) (let ((.cse123 (div (+ (div .cse124 10) 1) 5))) (and (< .cse123 0) (<= (mod (+ .cse123 1) 29) .cse2) (not (< (+ (div .cse124 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse125 (* 9 v_~a29~0_899))) (let ((.cse127 (+ (div .cse125 10) 1))) (let ((.cse126 (div .cse127 5))) (and (= (mod (+ (div .cse125 50) 1) 29) 0) (not (= (mod .cse125 10) 0)) (< (+ .cse126 1) 0) (<= (mod .cse126 29) .cse2) (= (mod .cse127 5) 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 ((.cse133 (* 9 v_~a29~0_899))) (let ((.cse130 (div .cse133 10))) (let ((.cse131 (div (+ .cse130 1) 5)) (.cse132 (div .cse133 50))) (and (= (mod .cse130 5) 0) (not (= (mod .cse131 29) 0)) (<= (mod .cse132 29) .cse8) (= (mod .cse133 10) 0) (not (= (mod (+ .cse131 1) 29) 0)) (< (+ .cse132 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse136 (* 9 v_~a29~0_899))) (let ((.cse135 (div .cse136 50)) (.cse134 (div .cse136 10))) (and (= (mod (div (+ .cse134 1) 5) 29) 0) (= (mod (+ .cse135 1) 29) 0) (<= (mod .cse135 29) .cse2) (not (< .cse134 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse139 (* 9 v_~a29~0_899))) (let ((.cse137 (div .cse139 10)) (.cse138 (div .cse139 50))) (and (= (mod .cse137 5) 0) (<= (mod .cse138 29) .cse2) (= (mod (+ (div (+ .cse137 1) 5) 1) 29) 0) (<= 0 .cse138) (= (mod .cse139 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse141 (* 9 v_~a29~0_899))) (let ((.cse140 (+ (div .cse141 10) 1))) (and (not (< .cse140 0)) (<= (mod (div .cse140 5) 29) .cse2) (< .cse141 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse142 (* 9 v_~a29~0_899))) (let ((.cse144 (div .cse142 50))) (let ((.cse143 (mod .cse144 29))) (and (= (mod (div .cse142 10) 5) 0) (<= .cse143 .cse2) (= 0 .cse143) (= (mod .cse142 10) 0) (not (< (+ .cse144 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse146 (* 9 v_~a29~0_899))) (let ((.cse145 (div .cse146 50))) (and (<= (mod .cse145 29) .cse2) (<= 0 .cse145) (= (mod .cse146 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse149 (* 9 v_~a29~0_899))) (let ((.cse150 (+ (div .cse149 10) 1))) (let ((.cse147 (div .cse149 50)) (.cse151 (div .cse150 5))) (let ((.cse152 (mod (+ .cse151 1) 29)) (.cse148 (+ .cse147 1))) (and (not (= 0 (mod .cse147 29))) (not (= (mod .cse148 29) 0)) (not (= (mod .cse149 10) 0)) (not (= (mod .cse150 5) 0)) (not (= (mod .cse151 29) 0)) (<= .cse152 .cse8) (not (= .cse152 0)) (< .cse148 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse153 (* 9 v_~a29~0_899))) (let ((.cse154 (div .cse153 50))) (and (= (mod (div .cse153 10) 5) 0) (<= (mod .cse154 29) .cse2) (<= 0 .cse154))))))) is different from true [2022-11-16 11:56:41,454 WARN L855 $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 ((.cse30 (* 9 v_~a29~0_899))) (let ((.cse29 (div .cse30 10))) (let ((.cse31 (div (+ .cse29 1) 5))) (and (= (mod .cse29 5) 0) (<= (mod (div .cse30 50) 29) .cse2) (= (mod (+ .cse31 1) 29) 0) (not (< .cse31 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 ((.cse50 (* 9 v_~a29~0_899))) (let ((.cse48 (div .cse50 10))) (let ((.cse49 (div (+ .cse48 1) 5))) (and (= (mod .cse48 5) 0) (= (mod (+ .cse49 1) 29) 0) (<= (mod (div .cse50 50) 29) .cse8) (= (mod .cse50 10) 0) (< .cse49 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse52 (* 9 v_~a29~0_899))) (let ((.cse51 (div (+ (div .cse52 10) 1) 5)) (.cse53 (div .cse52 50))) (and (= (mod .cse51 29) 0) (not (= (mod .cse52 10) 0)) (<= (mod (+ .cse51 1) 29) .cse8) (= 0 (mod .cse53 29)) (< (+ .cse53 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse56 (* 9 v_~a29~0_899))) (let ((.cse54 (div .cse56 50))) (let ((.cse57 (+ .cse54 1))) (let ((.cse55 (mod .cse57 29))) (and (not (= 0 (mod .cse54 29))) (not (= .cse55 0)) (= (mod (+ (div (+ (div .cse56 10) 1) 5) 1) 29) 0) (<= .cse55 .cse8) (= (mod .cse56 10) 0) (< .cse57 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) .cse8) (= 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 .cse8) (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 ((.cse96 (* 9 v_~a29~0_899))) (let ((.cse95 (div .cse96 50)) (.cse94 (div .cse96 10))) (and (= (mod .cse94 5) 0) (= (mod (+ .cse95 1) 29) 0) (<= (mod .cse95 29) .cse2) (= (mod .cse96 10) 0) (not (< (div (+ .cse94 1) 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse97 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse97 29) .cse2) (<= 0 .cse97)))) (exists ((v_~a29~0_899 Int)) (let ((.cse101 (* 9 v_~a29~0_899))) (let ((.cse99 (div .cse101 10))) (let ((.cse100 (div (+ .cse99 1) 5)) (.cse98 (mod (+ (div .cse101 50) 1) 29))) (and (= .cse98 0) (not (= (mod .cse99 5) 0)) (= (mod (+ .cse100 1) 29) 0) (= (mod .cse101 10) 0) (< .cse100 0) (<= .cse98 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse102 (* 9 v_~a29~0_899))) (let ((.cse104 (div .cse102 50))) (let ((.cse103 (mod .cse104 29))) (and (= (mod (div .cse102 10) 5) 0) (<= .cse103 .cse2) (= 0 .cse103) (= (mod .cse102 10) 0) (< (+ .cse104 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse108 (* 9 v_~a29~0_899))) (let ((.cse106 (div .cse108 50))) (let ((.cse105 (div .cse108 10)) (.cse107 (+ .cse106 1))) (and (= (mod (div (+ .cse105 1) 5) 29) 0) (not (= (mod .cse105 5) 0)) (= 0 (mod .cse106 29)) (<= (mod .cse107 29) .cse8) (= (mod .cse108 10) 0) (< .cse107 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse110 (* 9 v_~a29~0_899))) (let ((.cse111 (div .cse110 50))) (let ((.cse109 (mod .cse111 29))) (and (<= .cse109 .cse2) (= 0 .cse109) (= (mod .cse110 10) 0) (not (< (+ .cse111 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse112 (* 9 v_~a29~0_899))) (let ((.cse113 (div .cse112 50))) (let ((.cse114 (+ .cse113 1))) (and (not (= (mod (div (+ (div .cse112 10) 1) 5) 29) 0)) (= 0 (mod .cse113 29)) (<= (mod .cse114 29) .cse8) (= (mod .cse112 10) 0) (< .cse114 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse115 (* 9 v_~a29~0_899))) (let ((.cse116 (div .cse115 50))) (and (= (mod (div .cse115 10) 5) 0) (= (mod (+ .cse116 1) 29) 0) (<= (mod .cse116 29) .cse2) (not (< .cse116 0)) (= (mod .cse115 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse119 (* 9 v_~a29~0_899))) (let ((.cse118 (div (+ (div .cse119 10) 1) 5))) (let ((.cse117 (mod .cse118 29))) (and (= .cse117 0) (not (< (+ .cse118 1) 0)) (<= .cse117 .cse2) (< .cse119 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse121 (* 9 v_~a29~0_899))) (let ((.cse120 (div (+ (div .cse121 10) 1) 5))) (and (< .cse120 0) (<= (mod (+ .cse120 1) 29) .cse2) (not (< (+ (div .cse121 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse122 (* 9 v_~a29~0_899))) (let ((.cse124 (+ (div .cse122 10) 1))) (let ((.cse123 (div .cse124 5))) (and (= (mod (+ (div .cse122 50) 1) 29) 0) (not (= (mod .cse122 10) 0)) (< (+ .cse123 1) 0) (<= (mod .cse123 29) .cse2) (= (mod .cse124 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse125 (div (+ (div .cse126 10) 1) 5))) (and (not (< (+ .cse125 1) 0)) (<= (mod .cse125 29) .cse8) (< (+ (div .cse126 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse130 (* 9 v_~a29~0_899))) (let ((.cse127 (div .cse130 10))) (let ((.cse128 (div (+ .cse127 1) 5)) (.cse129 (div .cse130 50))) (and (= (mod .cse127 5) 0) (not (= (mod .cse128 29) 0)) (<= (mod .cse129 29) .cse8) (= (mod .cse130 10) 0) (not (= (mod (+ .cse128 1) 29) 0)) (< (+ .cse129 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse133 (* 9 v_~a29~0_899))) (let ((.cse132 (div .cse133 50)) (.cse131 (div .cse133 10))) (and (= (mod (div (+ .cse131 1) 5) 29) 0) (= (mod (+ .cse132 1) 29) 0) (<= (mod .cse132 29) .cse2) (not (< .cse131 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse136 (* 9 v_~a29~0_899))) (let ((.cse134 (div .cse136 10)) (.cse135 (div .cse136 50))) (and (= (mod .cse134 5) 0) (<= (mod .cse135 29) .cse2) (= (mod (+ (div (+ .cse134 1) 5) 1) 29) 0) (<= 0 .cse135) (= (mod .cse136 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse138 (* 9 v_~a29~0_899))) (let ((.cse137 (+ (div .cse138 10) 1))) (and (not (< .cse137 0)) (<= (mod (div .cse137 5) 29) .cse2) (< .cse138 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse139 (* 9 v_~a29~0_899))) (let ((.cse141 (div .cse139 50))) (let ((.cse140 (mod .cse141 29))) (and (= (mod (div .cse139 10) 5) 0) (<= .cse140 .cse2) (= 0 .cse140) (= (mod .cse139 10) 0) (not (< (+ .cse141 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse142 (div .cse143 50))) (and (<= (mod .cse142 29) .cse2) (<= 0 .cse142) (= (mod .cse143 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse146 (* 9 v_~a29~0_899))) (let ((.cse147 (+ (div .cse146 10) 1))) (let ((.cse144 (div .cse146 50)) (.cse148 (div .cse147 5))) (let ((.cse149 (mod (+ .cse148 1) 29)) (.cse145 (+ .cse144 1))) (and (not (= 0 (mod .cse144 29))) (not (= (mod .cse145 29) 0)) (not (= (mod .cse146 10) 0)) (not (= (mod .cse147 5) 0)) (not (= (mod .cse148 29) 0)) (<= .cse149 .cse8) (not (= .cse149 0)) (< .cse145 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse150 (* 9 v_~a29~0_899))) (let ((.cse151 (div .cse150 50))) (and (= (mod (div .cse150 10) 5) 0) (<= (mod .cse151 29) .cse2) (<= 0 .cse151))))))) is different from true