./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/fib_unsafe-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/fib_unsafe-5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 146f0d3d7f309689872842ec2e107172ef6d7d230f0dea419a95cb8899767aeb --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 19:03:25,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:03:25,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:03:25,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:03:25,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:03:25,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:03:25,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:03:25,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:03:25,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:03:25,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:03:25,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:03:25,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:03:25,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:03:25,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:03:25,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:03:25,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:03:25,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:03:25,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:03:25,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:03:25,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:03:25,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:03:25,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:03:25,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:03:25,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:03:25,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:03:25,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:03:25,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:03:25,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:03:25,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:03:25,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:03:25,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:03:25,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:03:25,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:03:25,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:03:25,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:03:25,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:03:25,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:03:25,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:03:25,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:03:25,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:03:25,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:03:25,814 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 19:03:25,847 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:03:25,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:03:25,847 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:03:25,848 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:03:25,848 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:03:25,849 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:03:25,849 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:03:25,849 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:03:25,849 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:03:25,849 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 19:03:25,850 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:03:25,850 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:03:25,850 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 19:03:25,850 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 19:03:25,850 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:03:25,851 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 19:03:25,851 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 19:03:25,851 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 19:03:25,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:03:25,852 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:03:25,852 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 19:03:25,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:03:25,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:03:25,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 19:03:25,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:03:25,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 19:03:25,854 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:03:25,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 19:03:25,854 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:03:25,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 19:03:25,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:03:25,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:03:25,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:03:25,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:03:25,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:03:25,855 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 19:03:25,856 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 19:03:25,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 19:03:25,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 19:03:25,856 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:03:25,856 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:03:25,857 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/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_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7 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 -> Taipan 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 -> 146f0d3d7f309689872842ec2e107172ef6d7d230f0dea419a95cb8899767aeb [2021-11-25 19:03:26,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:03:26,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:03:26,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:03:26,149 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:03:26,150 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:03:26,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/pthread/fib_unsafe-5.i [2021-11-25 19:03:26,223 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/data/f83c70fd7/9d4bf869a74f4660bd59254e238e382b/FLAG4efa23596 [2021-11-25 19:03:26,776 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:03:26,777 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/sv-benchmarks/c/pthread/fib_unsafe-5.i [2021-11-25 19:03:26,804 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/data/f83c70fd7/9d4bf869a74f4660bd59254e238e382b/FLAG4efa23596 [2021-11-25 19:03:27,040 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/data/f83c70fd7/9d4bf869a74f4660bd59254e238e382b [2021-11-25 19:03:27,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:03:27,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:03:27,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:03:27,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:03:27,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:03:27,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:03:27" (1/1) ... [2021-11-25 19:03:27,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158423c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:03:27, skipping insertion in model container [2021-11-25 19:03:27,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:03:27" (1/1) ... [2021-11-25 19:03:27,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:03:27,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:03:27,582 WARN L230 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_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/sv-benchmarks/c/pthread/fib_unsafe-5.i[30819,30832] [2021-11-25 19:03:27,588 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:03:27,598 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 19:03:27,684 WARN L230 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_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/sv-benchmarks/c/pthread/fib_unsafe-5.i[30819,30832] [2021-11-25 19:03:27,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:03:27,724 INFO L208 MainTranslator]: Completed translation [2021-11-25 19:03:27,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:03:27 WrapperNode [2021-11-25 19:03:27,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:03:27,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 19:03:27,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 19:03:27,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 19:03:27,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:03:27" (1/1) ... [2021-11-25 19:03:27,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:03:27" (1/1) ... [2021-11-25 19:03:27,771 INFO L137 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2021-11-25 19:03:27,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 19:03:27,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 19:03:27,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 19:03:27,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 19:03:27,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:03:27" (1/1) ... [2021-11-25 19:03:27,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:03:27" (1/1) ... [2021-11-25 19:03:27,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:03:27" (1/1) ... [2021-11-25 19:03:27,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:03:27" (1/1) ... [2021-11-25 19:03:27,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:03:27" (1/1) ... [2021-11-25 19:03:27,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:03:27" (1/1) ... [2021-11-25 19:03:27,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:03:27" (1/1) ... [2021-11-25 19:03:27,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 19:03:27,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 19:03:27,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 19:03:27,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 19:03:27,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:03:27" (1/1) ... [2021-11-25 19:03:27,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:03:27,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:03:27,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 19:03:27,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 19:03:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-11-25 19:03:27,910 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-11-25 19:03:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-11-25 19:03:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-11-25 19:03:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 19:03:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-25 19:03:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 19:03:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 19:03:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 19:03:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 19:03:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-25 19:03:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 19:03:27,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 19:03:27,914 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 19:03:28,114 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 19:03:28,116 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 19:03:28,333 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 19:03:28,341 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 19:03:28,348 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-25 19:03:28,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:03:28 BoogieIcfgContainer [2021-11-25 19:03:28,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 19:03:28,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 19:03:28,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 19:03:28,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 19:03:28,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 07:03:27" (1/3) ... [2021-11-25 19:03:28,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dbd7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:03:28, skipping insertion in model container [2021-11-25 19:03:28,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:03:27" (2/3) ... [2021-11-25 19:03:28,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dbd7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:03:28, skipping insertion in model container [2021-11-25 19:03:28,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:03:28" (3/3) ... [2021-11-25 19:03:28,362 INFO L111 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2021-11-25 19:03:28,373 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 19:03:28,373 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 19:03:28,373 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 19:03:28,373 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 19:03:28,436 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,436 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,436 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,436 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,437 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,437 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,437 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,437 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,437 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,438 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,438 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,438 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,438 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,438 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,438 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,439 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,439 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,439 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,439 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,439 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,439 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,439 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,440 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,440 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,442 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,442 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,442 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,442 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,446 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,447 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,447 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,447 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,447 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,451 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,451 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,451 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,451 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,452 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:03:28,457 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-25 19:03:28,503 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 19:03:28,509 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 19:03:28,509 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-11-25 19:03:28,523 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 19:03:28,537 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 96 transitions, 202 flow [2021-11-25 19:03:28,540 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 96 transitions, 202 flow [2021-11-25 19:03:28,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 96 transitions, 202 flow [2021-11-25 19:03:28,591 INFO L129 PetriNetUnfolder]: 7/94 cut-off events. [2021-11-25 19:03:28,592 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-25 19:03:28,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 7/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2021-11-25 19:03:28,601 INFO L116 LiptonReduction]: Number of co-enabled transitions 1870 [2021-11-25 19:03:32,097 INFO L131 LiptonReduction]: Checked pairs total: 1462 [2021-11-25 19:03:32,097 INFO L133 LiptonReduction]: Total number of compositions: 92 [2021-11-25 19:03:32,111 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2021-11-25 19:03:32,124 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:32,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-25 19:03:32,132 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:03:32,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-25 19:03:32,133 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:03:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:03:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2083717598, now seen corresponding path program 1 times [2021-11-25 19:03:32,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:03:32,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451883735] [2021-11-25 19:03:32,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:03:32,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:03:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:03:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:32,387 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:03:32,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451883735] [2021-11-25 19:03:32,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451883735] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:03:32,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:03:32,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:03:32,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589612739] [2021-11-25 19:03:32,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:03:32,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:03:32,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:03:32,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:03:32,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:03:32,433 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 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, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:03:32,487 INFO L93 Difference]: Finished difference Result 44 states and 122 transitions. [2021-11-25 19:03:32,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:03:32,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-11-25 19:03:32,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:03:32,500 INFO L225 Difference]: With dead ends: 44 [2021-11-25 19:03:32,500 INFO L226 Difference]: Without dead ends: 44 [2021-11-25 19:03:32,501 INFO L932 BasicCegarLoop]: 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 [2021-11-25 19:03:32,505 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:03:32,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:03:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-11-25 19:03:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-11-25 19:03:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 122 transitions. [2021-11-25 19:03:32,548 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 122 transitions. Word has length 6 [2021-11-25 19:03:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:03:32,549 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 122 transitions. [2021-11-25 19:03:32,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:32,549 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 122 transitions. [2021-11-25 19:03:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-25 19:03:32,550 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:03:32,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:03:32,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 19:03:32,551 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:03:32,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:03:32,552 INFO L85 PathProgramCache]: Analyzing trace with hash -170735922, now seen corresponding path program 1 times [2021-11-25 19:03:32,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:03:32,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012064401] [2021-11-25 19:03:32,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:03:32,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:03:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:03:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:32,632 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:03:32,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012064401] [2021-11-25 19:03:32,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012064401] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:03:32,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302512126] [2021-11-25 19:03:32,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:03:32,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:03:32,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:03:32,649 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:03:32,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 19:03:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:03:32,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:03:32,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:03:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:32,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:03:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:32,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302512126] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:03:32,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [583730326] [2021-11-25 19:03:32,825 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:03:32,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:03:32,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2021-11-25 19:03:32,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965867407] [2021-11-25 19:03:32,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:03:32,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 19:03:32,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:03:32,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 19:03:32,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:03:32,829 INFO L87 Difference]: Start difference. First operand 44 states and 122 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:32,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:03:32,956 INFO L93 Difference]: Finished difference Result 71 states and 203 transitions. [2021-11-25 19:03:32,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:03:32,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-25 19:03:32,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:03:32,959 INFO L225 Difference]: With dead ends: 71 [2021-11-25 19:03:32,959 INFO L226 Difference]: Without dead ends: 71 [2021-11-25 19:03:32,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:03:32,961 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:03:32,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:03:32,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-25 19:03:32,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-25 19:03:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 2.9) internal successors, (203), 70 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 203 transitions. [2021-11-25 19:03:33,000 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 203 transitions. Word has length 7 [2021-11-25 19:03:33,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:03:33,000 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 203 transitions. [2021-11-25 19:03:33,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:33,001 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 203 transitions. [2021-11-25 19:03:33,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-25 19:03:33,002 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:03:33,003 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2021-11-25 19:03:33,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 19:03:33,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:03:33,205 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:03:33,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:03:33,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1152399070, now seen corresponding path program 2 times [2021-11-25 19:03:33,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:03:33,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110220300] [2021-11-25 19:03:33,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:03:33,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:03:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:03:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:33,332 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:03:33,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110220300] [2021-11-25 19:03:33,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110220300] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:03:33,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166158020] [2021-11-25 19:03:33,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:03:33,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:03:33,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:03:33,342 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:03:33,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 19:03:33,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 19:03:33,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:03:33,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 19:03:33,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:03:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:33,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:03:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:33,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166158020] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:03:33,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1639250763] [2021-11-25 19:03:33,578 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:03:33,580 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:03:33,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-25 19:03:33,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607958263] [2021-11-25 19:03:33,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:03:33,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:03:33,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:03:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:03:33,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:03:33,590 INFO L87 Difference]: Start difference. First operand 71 states and 203 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:03:33,739 INFO L93 Difference]: Finished difference Result 125 states and 365 transitions. [2021-11-25 19:03:33,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 19:03:33,741 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 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 10 [2021-11-25 19:03:33,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:03:33,753 INFO L225 Difference]: With dead ends: 125 [2021-11-25 19:03:33,753 INFO L226 Difference]: Without dead ends: 125 [2021-11-25 19:03:33,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:03:33,757 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:03:33,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:03:33,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-25 19:03:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-11-25 19:03:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.943548387096774) internal successors, (365), 124 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) [2021-11-25 19:03:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 365 transitions. [2021-11-25 19:03:33,791 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 365 transitions. Word has length 10 [2021-11-25 19:03:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:03:33,792 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 365 transitions. [2021-11-25 19:03:33,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 365 transitions. [2021-11-25 19:03:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 19:03:33,795 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:03:33,795 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2021-11-25 19:03:33,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 19:03:34,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:03:34,021 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:03:34,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:03:34,022 INFO L85 PathProgramCache]: Analyzing trace with hash -981423710, now seen corresponding path program 3 times [2021-11-25 19:03:34,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:03:34,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415833813] [2021-11-25 19:03:34,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:03:34,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:03:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:03:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:34,218 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:03:34,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415833813] [2021-11-25 19:03:34,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415833813] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:03:34,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399109550] [2021-11-25 19:03:34,219 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:03:34,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:03:34,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:03:34,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:03:34,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 19:03:34,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:03:34,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:03:34,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 19:03:34,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:03:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:34,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:03:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:34,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399109550] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:03:34,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [837558443] [2021-11-25 19:03:34,410 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:03:34,412 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:03:34,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 14 [2021-11-25 19:03:34,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554349418] [2021-11-25 19:03:34,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:03:34,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:03:34,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:03:34,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:03:34,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:03:34,414 INFO L87 Difference]: Start difference. First operand 125 states and 365 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:34,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:03:34,554 INFO L93 Difference]: Finished difference Result 143 states and 419 transitions. [2021-11-25 19:03:34,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 19:03:34,554 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 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 16 [2021-11-25 19:03:34,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:03:34,557 INFO L225 Difference]: With dead ends: 143 [2021-11-25 19:03:34,557 INFO L226 Difference]: Without dead ends: 143 [2021-11-25 19:03:34,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:03:34,559 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:03:34,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:03:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-25 19:03:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-11-25 19:03:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.9507042253521125) internal successors, (419), 142 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 419 transitions. [2021-11-25 19:03:34,578 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 419 transitions. Word has length 16 [2021-11-25 19:03:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:03:34,579 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 419 transitions. [2021-11-25 19:03:34,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 419 transitions. [2021-11-25 19:03:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 19:03:34,581 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:03:34,582 INFO L514 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1] [2021-11-25 19:03:34,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 19:03:34,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:03:34,809 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:03:34,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:03:34,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1744625442, now seen corresponding path program 4 times [2021-11-25 19:03:34,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:03:34,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740077256] [2021-11-25 19:03:34,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:03:34,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:03:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:03:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:35,230 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:03:35,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740077256] [2021-11-25 19:03:35,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740077256] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:03:35,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616749272] [2021-11-25 19:03:35,231 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:03:35,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:03:35,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:03:35,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:03:35,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 19:03:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:03:35,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-25 19:03:35,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:03:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:35,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:04:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:04:02,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616749272] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:04:02,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1208053174] [2021-11-25 19:04:02,057 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:04:02,058 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:04:02,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2021-11-25 19:04:02,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927670862] [2021-11-25 19:04:02,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:04:02,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-25 19:04:02,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:04:02,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-25 19:04:02,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1349, Unknown=5, NotChecked=0, Total=1640 [2021-11-25 19:04:02,061 INFO L87 Difference]: Start difference. First operand 143 states and 419 transitions. Second operand has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:05,840 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (* 2 c_~cur~0))) (let ((.cse2 (+ c_~prev~0 c_~cur~0 1)) (.cse5 (+ .cse7 c_~prev~0)) (.cse1 (* c_~j~0 (- 1))) (.cse6 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse3 (* c_~i~0 (- 1))) (.cse4 (+ .cse7 c_~prev~0 1)) (.cse0 (+ (* 89 c_~prev~0) (* 144 c_~cur~0)))) (and (forall ((v_~cur~0_65 Int)) (or (and (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= 2 aux_mod_v_~cur~0_62_50) (< aux_div_v_~cur~0_62_50 (+ c_~cur~0 v_~cur~0_65 1)) (< aux_mod_v_~cur~0_62_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0 (* 2 v_~cur~0_65))))) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 2 c_~j~0) (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65))) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0 (* 2 v_~cur~0_65))) (<= 2 aux_mod_v_~cur~0_62_50) (< aux_div_v_~cur~0_62_50 (+ c_~cur~0 v_~cur~0_65 1)) (< aux_mod_v_~cur~0_62_50 0) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49)))) (< v_~cur~0_65 (+ c_~prev~0 c_~cur~0)))) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49))) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)))) (= c_~j~0 1) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (v_~cur~0_65 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 2 c_~j~0) (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65))) (< aux_div_v_~cur~0_62_50 (+ c_~prev~0 c_~cur~0 v_~cur~0_65 1)) (< v_~cur~0_65 (+ (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~cur~0_62_50) (< aux_mod_v_~cur~0_62_50 0) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0 (* 2 v_~cur~0_65))))) (<= (+ 143 c_~i~0) .cse0) (< (div (+ .cse1 (- 1) c_~cur~0) (- 2)) .cse2) (< (div (+ (- 1) .cse3 c_~cur~0) (- 2)) .cse2) (<= (div (+ .cse1 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse4) (< c_~i~0 .cse5) (<= (div (+ .cse3 c_~prev~0 (- 5)) (- 2)) .cse6) (forall ((v_~cur~0_62 Int)) (or (and (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0)))) (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0))))) (< v_~cur~0_62 (+ c_~prev~0 c_~cur~0)))) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (v_~cur~0_65 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0 (* 2 v_~cur~0_65))) (< aux_div_v_~cur~0_62_50 (+ c_~prev~0 c_~cur~0 v_~cur~0_65 1)) (< v_~cur~0_65 (+ (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~cur~0_62_50) (< aux_mod_v_~cur~0_62_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49))) (< c_~j~0 .cse5) (<= (div (+ .cse1 c_~prev~0 (- 5)) (- 2)) .cse6) (<= (div (+ .cse3 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse4) (<= 144 .cse0)))) is different from false [2021-11-25 19:05:08,836 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (* 2 c_~cur~0))) (let ((.cse3 (+ c_~prev~0 c_~cur~0 1)) (.cse0 (+ c_~prev~0 c_~cur~0)) (.cse6 (+ .cse8 c_~prev~0)) (.cse2 (* c_~j~0 (- 1))) (.cse7 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse4 (* c_~i~0 (- 1))) (.cse5 (+ .cse8 c_~prev~0 1)) (.cse1 (+ (* 89 c_~prev~0) (* 144 c_~cur~0)))) (and (< c_~j~0 .cse0) (forall ((v_~cur~0_65 Int)) (or (and (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= 2 aux_mod_v_~cur~0_62_50) (< aux_div_v_~cur~0_62_50 (+ c_~cur~0 v_~cur~0_65 1)) (< aux_mod_v_~cur~0_62_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0 (* 2 v_~cur~0_65))))) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 2 c_~j~0) (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65))) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0 (* 2 v_~cur~0_65))) (<= 2 aux_mod_v_~cur~0_62_50) (< aux_div_v_~cur~0_62_50 (+ c_~cur~0 v_~cur~0_65 1)) (< aux_mod_v_~cur~0_62_50 0) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49)))) (< v_~cur~0_65 (+ c_~prev~0 c_~cur~0)))) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49))) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)))) (= c_~j~0 1) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (v_~cur~0_65 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 2 c_~j~0) (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65))) (< aux_div_v_~cur~0_62_50 (+ c_~prev~0 c_~cur~0 v_~cur~0_65 1)) (< v_~cur~0_65 (+ (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~cur~0_62_50) (< aux_mod_v_~cur~0_62_50 0) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0 (* 2 v_~cur~0_65))))) (<= (+ 143 c_~i~0) .cse1) (< (div (+ .cse2 (- 1) c_~cur~0) (- 2)) .cse3) (< (div (+ (- 1) .cse4 c_~cur~0) (- 2)) .cse3) (<= (div (+ .cse2 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse5) (< c_~i~0 .cse6) (< c_~i~0 .cse0) (<= (div (+ .cse4 c_~prev~0 (- 5)) (- 2)) .cse7) (forall ((v_~cur~0_62 Int)) (or (and (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0)))) (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0))))) (< v_~cur~0_62 (+ c_~prev~0 c_~cur~0)))) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (v_~cur~0_65 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0 (* 2 v_~cur~0_65))) (< aux_div_v_~cur~0_62_50 (+ c_~prev~0 c_~cur~0 v_~cur~0_65 1)) (< v_~cur~0_65 (+ (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~cur~0_62_50) (< aux_mod_v_~cur~0_62_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49))) (< c_~j~0 .cse6) (<= (div (+ .cse2 c_~prev~0 (- 5)) (- 2)) .cse7) (<= (div (+ .cse4 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse5) (<= 144 .cse1)))) is different from false [2021-11-25 19:05:49,760 WARN L227 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 127 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 19:06:31,781 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (* 2 c_~cur~0))) (let ((.cse0 (+ 143 c_~i~0)) (.cse4 (+ c_~prev~0 c_~cur~0 1)) (.cse7 (+ .cse9 c_~prev~0)) (.cse3 (* c_~j~0 (- 1))) (.cse8 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse5 (* c_~i~0 (- 1))) (.cse6 (+ .cse9 c_~prev~0 1)) (.cse1 (+ (* 89 c_~cur~0) (* 55 c_~prev~0))) (.cse2 (+ (* 89 c_~prev~0) (* 144 c_~cur~0)))) (and (forall ((v_~cur~0_65 Int)) (or (and (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= 2 aux_mod_v_~cur~0_62_50) (< aux_div_v_~cur~0_62_50 (+ c_~cur~0 v_~cur~0_65 1)) (< aux_mod_v_~cur~0_62_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0 (* 2 v_~cur~0_65))))) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 2 c_~j~0) (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65))) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0 (* 2 v_~cur~0_65))) (<= 2 aux_mod_v_~cur~0_62_50) (< aux_div_v_~cur~0_62_50 (+ c_~cur~0 v_~cur~0_65 1)) (< aux_mod_v_~cur~0_62_50 0) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49)))) (< v_~cur~0_65 (+ c_~prev~0 c_~cur~0)))) (<= .cse0 .cse1) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49))) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)))) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 2 c_~j~0) (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 c_~cur~0))) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~cur~0_62_50) (< aux_mod_v_~cur~0_62_50 0) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< aux_div_v_~cur~0_62_50 (+ c_~prev~0 c_~cur~0 1)))) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= 2 aux_mod_v_~cur~0_62_50) (< aux_mod_v_~cur~0_62_50 0) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) (* 2 c_~cur~0) c_~prev~0)) (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 c_~cur~0) (* 2 c_~i~0))) (< aux_div_v_~cur~0_62_50 (+ c_~prev~0 c_~cur~0 1)))) (= c_~j~0 1) (<= .cse0 .cse2) (< (div (+ .cse3 (- 1) c_~cur~0) (- 2)) .cse4) (< (div (+ (- 1) .cse5 c_~cur~0) (- 2)) .cse4) (<= (div (+ .cse3 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse6) (< c_~i~0 .cse7) (<= (div (+ .cse5 c_~prev~0 (- 5)) (- 2)) .cse8) (forall ((v_~cur~0_62 Int)) (or (and (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0)))) (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0))))) (< v_~cur~0_62 (+ c_~prev~0 c_~cur~0)))) (< c_~j~0 .cse7) (<= (div (+ .cse3 c_~prev~0 (- 5)) (- 2)) .cse8) (<= (div (+ .cse5 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse6) (<= 144 .cse1) (<= 144 .cse2)))) is different from false [2021-11-25 19:07:22,219 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* 2 c_~cur~0))) (let ((.cse5 (+ c_~prev~0 c_~cur~0 1)) (.cse0 (+ c_~prev~0 c_~cur~0)) (.cse8 (+ .cse10 c_~prev~0)) (.cse4 (* c_~j~0 (- 1))) (.cse9 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse1 (+ 143 c_~i~0)) (.cse3 (+ (* 34 c_~prev~0) (* 55 c_~cur~0))) (.cse6 (* c_~i~0 (- 1))) (.cse7 (+ .cse10 c_~prev~0 1)) (.cse2 (+ (* 89 c_~cur~0) (* 55 c_~prev~0)))) (and (< c_~j~0 .cse0) (<= .cse1 .cse2) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49))) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)))) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 2 c_~j~0) (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 c_~cur~0))) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~cur~0_62_50) (< aux_mod_v_~cur~0_62_50 0) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< aux_div_v_~cur~0_62_50 (+ c_~prev~0 c_~cur~0 1)))) (<= 144 .cse3) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= 2 aux_mod_v_~cur~0_62_50) (< aux_mod_v_~cur~0_62_50 0) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) (* 2 c_~cur~0) c_~prev~0)) (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 c_~cur~0) (* 2 c_~i~0))) (< aux_div_v_~cur~0_62_50 (+ c_~prev~0 c_~cur~0 1)))) (= c_~j~0 1) (< (div (+ .cse4 (- 1) c_~cur~0) (- 2)) .cse5) (< (div (+ (- 1) .cse6 c_~cur~0) (- 2)) .cse5) (<= (div (+ .cse4 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse7) (< c_~i~0 .cse8) (< c_~i~0 .cse0) (<= (div (+ .cse6 c_~prev~0 (- 5)) (- 2)) .cse9) (forall ((v_~cur~0_62 Int)) (or (and (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0)))) (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0))))) (< v_~cur~0_62 (+ c_~prev~0 c_~cur~0)))) (< c_~j~0 .cse8) (<= (div (+ .cse4 c_~prev~0 (- 5)) (- 2)) .cse9) (<= .cse1 .cse3) (<= (div (+ .cse6 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse7) (<= 144 .cse2)))) is different from false [2021-11-25 19:07:25,782 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* 2 c_~cur~0))) (let ((.cse2 (+ (* 21 c_~prev~0) (* 34 c_~cur~0))) (.cse5 (+ c_~prev~0 c_~cur~0 1)) (.cse0 (+ c_~prev~0 c_~cur~0)) (.cse8 (+ .cse10 c_~prev~0)) (.cse4 (* c_~j~0 (- 1))) (.cse9 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse1 (+ 143 c_~i~0)) (.cse3 (+ (* 34 c_~prev~0) (* 55 c_~cur~0))) (.cse6 (* c_~i~0 (- 1))) (.cse7 (+ .cse10 c_~prev~0 1))) (and (< c_~j~0 .cse0) (<= .cse1 .cse2) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49))) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)))) (< c_~i~0 c_~cur~0) (<= 144 .cse2) (<= 144 .cse3) (= c_~j~0 1) (< (div (+ .cse4 (- 1) c_~cur~0) (- 2)) .cse5) (< (div (+ (- 1) .cse6 c_~cur~0) (- 2)) .cse5) (<= (div (+ .cse4 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse7) (< c_~i~0 .cse8) (< c_~i~0 .cse0) (<= (div (+ .cse6 c_~prev~0 (- 5)) (- 2)) .cse9) (forall ((v_~cur~0_62 Int)) (or (and (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0)))) (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0))))) (< v_~cur~0_62 (+ c_~prev~0 c_~cur~0)))) (< c_~j~0 .cse8) (<= (div (+ .cse4 c_~prev~0 (- 5)) (- 2)) .cse9) (<= .cse1 .cse3) (<= (div (+ .cse6 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse7) (< c_~j~0 c_~cur~0)))) is different from false [2021-11-25 19:07:57,634 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 21 c_~prev~0) (* 34 c_~cur~0))) (.cse6 (+ c_~prev~0 c_~cur~0 1)) (.cse5 (* c_~j~0 (- 1))) (.cse9 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse0 (+ 143 c_~i~0)) (.cse3 (+ (* 34 c_~prev~0) (* 55 c_~cur~0))) (.cse7 (* c_~i~0 (- 1))) (.cse8 (+ (* 2 c_~cur~0) c_~prev~0 1)) (.cse1 (+ (* 89 c_~cur~0) (* 55 c_~prev~0))) (.cse4 (+ (* 89 c_~prev~0) (* 144 c_~cur~0)))) (and (<= .cse0 .cse1) (<= .cse0 .cse2) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49))) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)))) (<= 144 .cse2) (<= 144 .cse3) (= c_~j~0 1) (<= .cse0 .cse4) (< (div (+ .cse5 (- 1) c_~cur~0) (- 2)) .cse6) (< (div (+ (- 1) .cse7 c_~cur~0) (- 2)) .cse6) (<= (div (+ .cse5 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse8) (<= (div (+ .cse7 c_~prev~0 (- 5)) (- 2)) .cse9) (forall ((v_~cur~0_62 Int)) (or (and (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0)))) (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0))))) (< v_~cur~0_62 (+ c_~prev~0 c_~cur~0)))) (<= (div (+ .cse5 c_~prev~0 (- 5)) (- 2)) .cse9) (<= .cse0 .cse3) (<= (div (+ .cse7 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse8) (<= 144 .cse1) (<= 144 .cse4))) is different from false [2021-11-25 19:09:41,837 WARN L227 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 135 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 19:10:07,820 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 143 c_~i~0)) (.cse4 (+ c_~prev~0 c_~cur~0 1)) (.cse3 (* c_~j~0 (- 1))) (.cse7 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse5 (* c_~i~0 (- 1))) (.cse6 (+ (* 2 c_~cur~0) c_~prev~0 1)) (.cse1 (+ (* 89 c_~cur~0) (* 55 c_~prev~0))) (.cse2 (+ (* 89 c_~prev~0) (* 144 c_~cur~0)))) (and (forall ((v_~cur~0_65 Int)) (or (and (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= 2 aux_mod_v_~cur~0_62_50) (< aux_div_v_~cur~0_62_50 (+ c_~cur~0 v_~cur~0_65 1)) (< aux_mod_v_~cur~0_62_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0 (* 2 v_~cur~0_65))))) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 2 c_~j~0) (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65))) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0 (* 2 v_~cur~0_65))) (<= 2 aux_mod_v_~cur~0_62_50) (< aux_div_v_~cur~0_62_50 (+ c_~cur~0 v_~cur~0_65 1)) (< aux_mod_v_~cur~0_62_50 0) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49)))) (< v_~cur~0_65 (+ c_~prev~0 c_~cur~0)))) (<= .cse0 .cse1) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49))) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)))) (= c_~j~0 1) (<= .cse0 .cse2) (< (div (+ .cse3 (- 1) c_~cur~0) (- 2)) .cse4) (< (div (+ (- 1) .cse5 c_~cur~0) (- 2)) .cse4) (<= (div (+ .cse3 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse6) (<= (div (+ .cse5 c_~prev~0 (- 5)) (- 2)) .cse7) (forall ((v_~cur~0_62 Int)) (or (and (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0)))) (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0))))) (< v_~cur~0_62 (+ c_~prev~0 c_~cur~0)))) (<= (div (+ .cse3 c_~prev~0 (- 5)) (- 2)) .cse7) (<= (div (+ .cse5 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse6) (<= 144 .cse1) (<= 144 .cse2))) is different from false [2021-11-25 19:10:09,924 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* 2 c_~cur~0))) (let ((.cse5 (+ c_~prev~0 c_~cur~0 1)) (.cse8 (+ .cse10 c_~prev~0)) (.cse4 (* c_~j~0 (- 1))) (.cse9 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse0 (+ 143 c_~i~0)) (.cse2 (+ (* 34 c_~prev~0) (* 55 c_~cur~0))) (.cse6 (* c_~i~0 (- 1))) (.cse7 (+ .cse10 c_~prev~0 1)) (.cse1 (+ (* 89 c_~cur~0) (* 55 c_~prev~0))) (.cse3 (+ (* 89 c_~prev~0) (* 144 c_~cur~0)))) (and (<= .cse0 .cse1) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49))) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)))) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 2 c_~j~0) (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 c_~cur~0))) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~cur~0_62_50) (< aux_mod_v_~cur~0_62_50 0) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< aux_div_v_~cur~0_62_50 (+ c_~prev~0 c_~cur~0 1)))) (<= 144 .cse2) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= 2 aux_mod_v_~cur~0_62_50) (< aux_mod_v_~cur~0_62_50 0) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) (* 2 c_~cur~0) c_~prev~0)) (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 c_~cur~0) (* 2 c_~i~0))) (< aux_div_v_~cur~0_62_50 (+ c_~prev~0 c_~cur~0 1)))) (= c_~j~0 1) (<= .cse0 .cse3) (< (div (+ .cse4 (- 1) c_~cur~0) (- 2)) .cse5) (< (div (+ (- 1) .cse6 c_~cur~0) (- 2)) .cse5) (<= (div (+ .cse4 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse7) (< c_~i~0 .cse8) (<= (div (+ .cse6 c_~prev~0 (- 5)) (- 2)) .cse9) (forall ((v_~cur~0_62 Int)) (or (and (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0)))) (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0))))) (< v_~cur~0_62 (+ c_~prev~0 c_~cur~0)))) (< c_~j~0 .cse8) (<= (div (+ .cse4 c_~prev~0 (- 5)) (- 2)) .cse9) (<= .cse0 .cse2) (<= (div (+ .cse6 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse7) (<= 144 .cse1) (<= 144 .cse3)))) is different from false [2021-11-25 19:10:47,939 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* 2 c_~cur~0))) (let ((.cse5 (+ c_~prev~0 c_~cur~0 1)) (.cse8 (+ .cse10 c_~prev~0)) (.cse4 (* c_~j~0 (- 1))) (.cse9 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse0 (+ 143 c_~i~0)) (.cse2 (+ (* 34 c_~prev~0) (* 55 c_~cur~0))) (.cse6 (* c_~i~0 (- 1))) (.cse7 (+ .cse10 c_~prev~0 1)) (.cse1 (+ (* 89 c_~cur~0) (* 55 c_~prev~0))) (.cse3 (+ (* 89 c_~prev~0) (* 144 c_~cur~0)))) (and (<= .cse0 .cse1) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49))) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)))) (<= 144 .cse2) (= c_~j~0 1) (<= .cse0 .cse3) (< (div (+ .cse4 (- 1) c_~cur~0) (- 2)) .cse5) (< (div (+ (- 1) .cse6 c_~cur~0) (- 2)) .cse5) (<= (div (+ .cse4 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse7) (< c_~i~0 .cse8) (<= (div (+ .cse6 c_~prev~0 (- 5)) (- 2)) .cse9) (forall ((v_~cur~0_62 Int)) (or (and (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0)))) (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0))))) (< v_~cur~0_62 (+ c_~prev~0 c_~cur~0)))) (< c_~j~0 .cse8) (<= (div (+ .cse4 c_~prev~0 (- 5)) (- 2)) .cse9) (<= .cse0 .cse2) (<= (div (+ .cse6 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse7) (<= 144 .cse1) (<= 144 .cse3)))) is different from false [2021-11-25 19:11:42,009 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (* 2 c_~cur~0))) (let ((.cse3 (+ c_~prev~0 c_~cur~0 1)) (.cse0 (+ c_~prev~0 c_~cur~0)) (.cse6 (+ .cse8 c_~prev~0)) (.cse2 (* c_~j~0 (- 1))) (.cse7 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse4 (* c_~i~0 (- 1))) (.cse5 (+ .cse8 c_~prev~0 1)) (.cse1 (+ (* 89 c_~prev~0) (* 144 c_~cur~0)))) (and (< c_~j~0 .cse0) (forall ((v_~cur~0_65 Int)) (or (and (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= 2 aux_mod_v_~cur~0_62_50) (< aux_div_v_~cur~0_62_50 (+ c_~cur~0 v_~cur~0_65 1)) (< aux_mod_v_~cur~0_62_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0 (* 2 v_~cur~0_65))))) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 2 c_~j~0) (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65))) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0 (* 2 v_~cur~0_65))) (<= 2 aux_mod_v_~cur~0_62_50) (< aux_div_v_~cur~0_62_50 (+ c_~cur~0 v_~cur~0_65 1)) (< aux_mod_v_~cur~0_62_50 0) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49)))) (< v_~cur~0_65 (+ c_~prev~0 c_~cur~0)))) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49))) (forall ((aux_mod_v_~prev~0_75_49 Int) (v_~cur~0_62 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< v_~cur~0_62 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0)))) (< c_~i~0 c_~cur~0) (= c_~j~0 1) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (v_~cur~0_65 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 2 c_~j~0) (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65))) (< aux_div_v_~cur~0_62_50 (+ c_~prev~0 c_~cur~0 v_~cur~0_65 1)) (< v_~cur~0_65 (+ (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~cur~0_62_50) (< aux_mod_v_~cur~0_62_50 0) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0 (* 2 v_~cur~0_65))))) (<= (+ 143 c_~i~0) .cse1) (< (div (+ .cse2 (- 1) c_~cur~0) (- 2)) .cse3) (< (div (+ (- 1) .cse4 c_~cur~0) (- 2)) .cse3) (<= (div (+ .cse2 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse5) (< c_~i~0 .cse6) (< c_~i~0 .cse0) (<= (div (+ .cse4 c_~prev~0 (- 5)) (- 2)) .cse7) (forall ((v_~cur~0_62 Int)) (or (and (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0)))) (forall ((aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~prev~0_75_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_75_49) (+ (* 2 aux_mod_v_~prev~0_75_49) 12 (* 4 v_~cur~0_62) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~cur~0))))) (< v_~cur~0_62 (+ c_~prev~0 c_~cur~0)))) (forall ((aux_mod_v_~cur~0_62_50 Int) (aux_mod_v_~prev~0_75_49 Int) (aux_div_v_~cur~0_62_50 Int) (v_~cur~0_65 Int) (aux_div_v_~prev~0_75_49 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_75_49) (+ (* 2 aux_div_v_~prev~0_75_49) c_~prev~0 c_~cur~0 (* 2 v_~cur~0_65))) (< aux_div_v_~cur~0_62_50 (+ c_~prev~0 c_~cur~0 v_~cur~0_65 1)) (< v_~cur~0_65 (+ (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~cur~0_62_50) (< aux_mod_v_~cur~0_62_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_62_50) (* 5 aux_div_v_~prev~0_75_49)) (+ (* 8 aux_div_v_~cur~0_62_50) (* 2 aux_mod_v_~prev~0_75_49) 8 (* 4 v_~cur~0_65) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_75_49 0) (<= 2 aux_mod_v_~prev~0_75_49))) (< c_~j~0 .cse6) (<= (div (+ .cse2 c_~prev~0 (- 5)) (- 2)) .cse7) (<= (div (+ .cse4 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse5) (<= 144 .cse1) (< c_~j~0 c_~cur~0)))) is different from false [2021-11-25 19:12:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:22,684 INFO L93 Difference]: Finished difference Result 5385 states and 16359 transitions. [2021-11-25 19:12:22,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2021-11-25 19:12:22,685 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 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 18 [2021-11-25 19:12:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:22,740 INFO L225 Difference]: With dead ends: 5385 [2021-11-25 19:12:22,741 INFO L226 Difference]: Without dead ends: 5185 [2021-11-25 19:12:22,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 12 SyntacticMatches, 70 SemanticMatches, 204 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 22202 ImplicationChecksByTransitivity, 513.0s TimeCoverageRelationStatistics Valid=9036, Invalid=29195, Unknown=29, NotChecked=3970, Total=42230 [2021-11-25 19:12:22,754 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 876 mSDsluCounter, 2489 mSDsCounter, 0 mSdLazyCounter, 3097 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 3097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2528 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:22,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [876 Valid, 0 Invalid, 5820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 3097 Invalid, 0 Unknown, 2528 Unchecked, 7.1s Time] [2021-11-25 19:12:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states. [2021-11-25 19:12:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 3416. [2021-11-25 19:12:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3416 states, 3415 states have (on average 3.3701317715959003) internal successors, (11509), 3415 states have internal predecessors, (11509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 11509 transitions. [2021-11-25 19:12:22,978 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 11509 transitions. Word has length 18 [2021-11-25 19:12:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:22,979 INFO L470 AbstractCegarLoop]: Abstraction has 3416 states and 11509 transitions. [2021-11-25 19:12:22,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 11509 transitions. [2021-11-25 19:12:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 19:12:22,994 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:22,994 INFO L514 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:23,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 19:12:23,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:12:23,221 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:12:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:23,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1715364142, now seen corresponding path program 1 times [2021-11-25 19:12:23,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:23,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192610275] [2021-11-25 19:12:23,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:23,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:24,056 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:24,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192610275] [2021-11-25 19:12:24,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192610275] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:12:24,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265377987] [2021-11-25 19:12:24,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:24,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:12:24,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:12:24,064 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:12:24,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f918a1-47b0-4e1e-a4aa-3730dafb7e4b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 19:12:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:24,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-25 19:12:24,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:12:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:25,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:13:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:13,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265377987] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:13:13,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [283853921] [2021-11-25 19:13:13,642 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:13:13,643 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:13:13,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2021-11-25 19:13:13,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705334345] [2021-11-25 19:13:13,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:13:13,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-25 19:13:13,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:13,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-25 19:13:13,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=1506, Unknown=6, NotChecked=0, Total=1892 [2021-11-25 19:13:13,645 INFO L87 Difference]: Start difference. First operand 3416 states and 11509 transitions. Second operand has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:02,481 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* 2 c_~cur~0))) (let ((.cse1 (+ c_~prev~0 c_~cur~0 1)) (.cse4 (+ .cse6 c_~prev~0)) (.cse0 (* c_~j~0 (- 1))) (.cse5 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse2 (* c_~i~0 (- 1))) (.cse3 (+ .cse6 c_~prev~0 1))) (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int) (v_~cur~0_89 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 v_~cur~0_89 1)) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) 8 (* 2 c_~i~0))) (<= 2 aux_mod_v_~prev~0_98_49) (< v_~cur~0_89 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50))) (forall ((v_~cur~0_89 Int)) (or (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) 8 (* 2 c_~i~0))) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 1)))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) (* 2 c_~j~0) 8)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 1))))) (< v_~cur~0_89 (+ c_~prev~0 c_~cur~0)))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~prev~0_98_49) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) 12 (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 1)) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 2 c_~j~0) 8 (* 4 c_~cur~0))) (< aux_mod_v_~cur~0_86_50 0) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~prev~0_98_49))) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int) (v_~cur~0_89 Int)) (or (< aux_mod_v_~cur~0_86_50 0) (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 v_~cur~0_89 1)) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) (* 2 c_~j~0) 8)) (<= 2 aux_mod_v_~prev~0_98_49) (< v_~cur~0_89 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))))) (= c_~j~0 1) (<= (+ 143 c_~i~0) (+ (* 89 c_~prev~0) (* 144 c_~cur~0))) (< (div (+ .cse0 (- 1) c_~cur~0) (- 2)) .cse1) (< (div (+ (- 1) .cse2 c_~cur~0) (- 2)) .cse1) (forall ((v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (<= 2 aux_mod_v_~prev~0_98_49) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) 12 (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) (* 2 c_~j~0) 12)) (<= 2 aux_mod_v_~prev~0_98_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~prev~0_98_49 0)))))) (forall ((v_~cur~0_91 Int)) (or (< v_~cur~0_91 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int) (v_~cur~0_89 Int)) (or (< v_~cur~0_89 (+ (* 2 v_~cur~0_91) c_~cur~0)) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) (* 2 c_~j~0) 8)) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 v_~cur~0_91 1)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49) v_~cur~0_91)))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int) (v_~cur~0_89 Int)) (or (< v_~cur~0_89 (+ (* 2 v_~cur~0_91) c_~cur~0)) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) 8 (* 2 c_~i~0))) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 v_~cur~0_91 1)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49) v_~cur~0_91))))))) (<= (div (+ .cse0 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse3) (< c_~i~0 .cse4) (<= (div (+ .cse2 c_~prev~0 (- 5)) (- 2)) .cse5) (< c_~j~0 .cse4) (<= (div (+ .cse0 c_~prev~0 (- 5)) (- 2)) .cse5) (<= (div (+ .cse2 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse3) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) (* 2 c_~j~0) 12)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 1)) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= 2 aux_mod_v_~prev~0_98_49) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) 8 (* 4 c_~cur~0) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50)))))) is different from false [2021-11-25 19:14:04,555 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (* 2 c_~cur~0))) (let ((.cse2 (+ c_~prev~0 c_~cur~0 1)) (.cse0 (+ c_~prev~0 c_~cur~0)) (.cse5 (+ .cse7 c_~prev~0)) (.cse1 (* c_~j~0 (- 1))) (.cse6 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse3 (* c_~i~0 (- 1))) (.cse4 (+ .cse7 c_~prev~0 1))) (and (< c_~j~0 .cse0) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int) (v_~cur~0_89 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 v_~cur~0_89 1)) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) 8 (* 2 c_~i~0))) (<= 2 aux_mod_v_~prev~0_98_49) (< v_~cur~0_89 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50))) (forall ((v_~cur~0_89 Int)) (or (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) 8 (* 2 c_~i~0))) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 1)))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) (* 2 c_~j~0) 8)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 1))))) (< v_~cur~0_89 (+ c_~prev~0 c_~cur~0)))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~prev~0_98_49) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) 12 (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 1)) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 2 c_~j~0) 8 (* 4 c_~cur~0))) (< aux_mod_v_~cur~0_86_50 0) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~prev~0_98_49))) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int) (v_~cur~0_89 Int)) (or (< aux_mod_v_~cur~0_86_50 0) (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 v_~cur~0_89 1)) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) (* 2 c_~j~0) 8)) (<= 2 aux_mod_v_~prev~0_98_49) (< v_~cur~0_89 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))))) (= c_~j~0 1) (<= (+ 143 c_~i~0) (+ (* 89 c_~prev~0) (* 144 c_~cur~0))) (< (div (+ .cse1 (- 1) c_~cur~0) (- 2)) .cse2) (< (div (+ (- 1) .cse3 c_~cur~0) (- 2)) .cse2) (forall ((v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (<= 2 aux_mod_v_~prev~0_98_49) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) 12 (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) (* 2 c_~j~0) 12)) (<= 2 aux_mod_v_~prev~0_98_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~prev~0_98_49 0)))))) (<= (div (+ .cse1 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse4) (< c_~i~0 .cse5) (< c_~i~0 .cse0) (<= (div (+ .cse3 c_~prev~0 (- 5)) (- 2)) .cse6) (< c_~j~0 .cse5) (<= (div (+ .cse1 c_~prev~0 (- 5)) (- 2)) .cse6) (<= (div (+ .cse3 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse4) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) (* 2 c_~j~0) 12)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 1)) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= 2 aux_mod_v_~prev~0_98_49) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) 8 (* 4 c_~cur~0) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50)))))) is different from false [2021-11-25 19:14:06,906 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* 2 c_~cur~0))) (let ((.cse1 (+ c_~prev~0 c_~cur~0 1)) (.cse4 (+ .cse6 c_~prev~0)) (.cse0 (* c_~j~0 (- 1))) (.cse5 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse2 (* c_~i~0 (- 1))) (.cse3 (+ .cse6 c_~prev~0 1))) (and (= c_~j~0 1) (<= (+ 143 c_~i~0) (+ (* 89 c_~prev~0) (* 144 c_~cur~0))) (< (div (+ .cse0 (- 1) c_~cur~0) (- 2)) .cse1) (< (div (+ (- 1) .cse2 c_~cur~0) (- 2)) .cse1) (forall ((v_~cur~0_91 Int)) (or (< v_~cur~0_91 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int) (v_~cur~0_89 Int)) (or (< v_~cur~0_89 (+ (* 2 v_~cur~0_91) c_~cur~0)) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) (* 2 c_~j~0) 8)) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 v_~cur~0_91 1)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49) v_~cur~0_91)))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int) (v_~cur~0_89 Int)) (or (< v_~cur~0_89 (+ (* 2 v_~cur~0_91) c_~cur~0)) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) 8 (* 2 c_~i~0))) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 v_~cur~0_91 1)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49) v_~cur~0_91))))))) (<= (div (+ .cse0 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse3) (< c_~i~0 .cse4) (<= (div (+ .cse2 c_~prev~0 (- 5)) (- 2)) .cse5) (< c_~j~0 .cse4) (<= (div (+ .cse0 c_~prev~0 (- 5)) (- 2)) .cse5) (<= (div (+ .cse2 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse3)))) is different from false [2021-11-25 19:16:39,972 WARN L227 SmtUtils]: Spent 16.45s on a formula simplification. DAG size of input: 132 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 19:16:47,616 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (* 2 c_~cur~0))) (let ((.cse1 (+ (* 89 c_~prev~0) (* 144 c_~cur~0))) (.cse3 (+ c_~prev~0 c_~cur~0 1)) (.cse0 (+ c_~prev~0 c_~cur~0)) (.cse6 (+ .cse8 c_~prev~0)) (.cse2 (* c_~j~0 (- 1))) (.cse7 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse4 (* c_~i~0 (- 1))) (.cse5 (+ .cse8 c_~prev~0 1))) (and (< c_~j~0 .cse0) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int) (v_~cur~0_89 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 v_~cur~0_89 1)) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) 8 (* 2 c_~i~0))) (<= 2 aux_mod_v_~prev~0_98_49) (< v_~cur~0_89 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50))) (forall ((v_~cur~0_89 Int)) (or (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) 8 (* 2 c_~i~0))) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 1)))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) (* 2 c_~j~0) 8)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 1))))) (< v_~cur~0_89 (+ c_~prev~0 c_~cur~0)))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~prev~0_98_49) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) 12 (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 1)) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 2 c_~j~0) 8 (* 4 c_~cur~0))) (< aux_mod_v_~cur~0_86_50 0) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~prev~0_98_49))) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50))) (<= (+ 142 c_~j~0) .cse1) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int) (v_~cur~0_89 Int)) (or (< aux_mod_v_~cur~0_86_50 0) (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 v_~cur~0_89 1)) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) (* 2 c_~j~0) 8)) (<= 2 aux_mod_v_~prev~0_98_49) (< v_~cur~0_89 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))))) (= c_~j~0 1) (<= (+ 143 c_~i~0) .cse1) (< (div (+ .cse2 (- 1) c_~cur~0) (- 2)) .cse3) (< (div (+ (- 1) .cse4 c_~cur~0) (- 2)) .cse3) (forall ((v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (<= 2 aux_mod_v_~prev~0_98_49) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) 12 (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) (* 2 c_~j~0) 12)) (<= 2 aux_mod_v_~prev~0_98_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~prev~0_98_49 0)))))) (<= (div (+ .cse2 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse5) (< c_~i~0 .cse6) (< c_~i~0 .cse0) (<= (div (+ .cse4 c_~prev~0 (- 5)) (- 2)) .cse7) (< c_~j~0 .cse6) (<= (div (+ .cse2 c_~prev~0 (- 5)) (- 2)) .cse7) (<= (div (+ .cse4 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse5) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) (* 2 c_~j~0) 12)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 1)) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= 2 aux_mod_v_~prev~0_98_49) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) 8 (* 4 c_~cur~0) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50)))))) is different from false [2021-11-25 19:16:50,409 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (* 2 c_~cur~0))) (let ((.cse2 (+ (* 89 c_~cur~0) (* 55 c_~prev~0))) (.cse1 (+ 143 c_~i~0)) (.cse4 (+ c_~prev~0 c_~cur~0 1)) (.cse0 (+ c_~prev~0 c_~cur~0)) (.cse7 (+ .cse9 c_~prev~0)) (.cse3 (* c_~j~0 (- 1))) (.cse8 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse5 (* c_~i~0 (- 1))) (.cse6 (+ .cse9 c_~prev~0 1))) (and (< c_~j~0 .cse0) (forall ((v_~cur~0_89 Int)) (or (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) 8 (* 2 c_~i~0))) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 1)))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) (* 2 c_~j~0) 8)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 1))))) (< v_~cur~0_89 (+ c_~prev~0 c_~cur~0)))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~prev~0_98_49) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) 12 (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))))) (<= .cse1 .cse2) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 1)) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 2 c_~j~0) 8 (* 4 c_~cur~0))) (< aux_mod_v_~cur~0_86_50 0) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~prev~0_98_49))) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50))) (< c_~i~0 c_~cur~0) (= c_~j~0 1) (<= (+ 142 c_~j~0) .cse2) (<= .cse1 (+ (* 89 c_~prev~0) (* 144 c_~cur~0))) (< (div (+ .cse3 (- 1) c_~cur~0) (- 2)) .cse4) (< (div (+ (- 1) .cse5 c_~cur~0) (- 2)) .cse4) (forall ((v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (<= 2 aux_mod_v_~prev~0_98_49) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) 12 (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) (* 2 c_~j~0) 12)) (<= 2 aux_mod_v_~prev~0_98_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~prev~0_98_49 0)))))) (<= (div (+ .cse3 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse6) (< c_~i~0 .cse7) (< c_~i~0 .cse0) (<= (div (+ .cse5 c_~prev~0 (- 5)) (- 2)) .cse8) (< c_~j~0 .cse7) (<= (div (+ .cse3 c_~prev~0 (- 5)) (- 2)) .cse8) (<= (div (+ .cse5 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse6) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) (* 2 c_~j~0) 12)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 1)) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= 2 aux_mod_v_~prev~0_98_49) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) 8 (* 4 c_~cur~0) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50))) (< c_~j~0 c_~cur~0)))) is different from false [2021-11-25 19:16:52,864 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (* 2 c_~cur~0))) (let ((.cse2 (+ c_~prev~0 c_~cur~0 1)) (.cse0 (+ c_~prev~0 c_~cur~0)) (.cse5 (+ .cse7 c_~prev~0)) (.cse1 (* c_~j~0 (- 1))) (.cse6 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse3 (* c_~i~0 (- 1))) (.cse4 (+ .cse7 c_~prev~0 1))) (and (< c_~j~0 .cse0) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int) (v_~cur~0_89 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 v_~cur~0_89 1)) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) 8 (* 2 c_~i~0))) (<= 2 aux_mod_v_~prev~0_98_49) (< v_~cur~0_89 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50))) (forall ((v_~cur~0_89 Int)) (or (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) 8 (* 2 c_~i~0))) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 1)))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) (* 2 c_~j~0) 8)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 1))))) (< v_~cur~0_89 (+ c_~prev~0 c_~cur~0)))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~prev~0_98_49) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) 12 (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 1)) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 2 c_~j~0) 8 (* 4 c_~cur~0))) (< aux_mod_v_~cur~0_86_50 0) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~prev~0_98_49))) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int) (v_~cur~0_89 Int)) (or (< aux_mod_v_~cur~0_86_50 0) (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 v_~cur~0_89 1)) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) (* 2 c_~j~0) 8)) (<= 2 aux_mod_v_~prev~0_98_49) (< v_~cur~0_89 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))))) (< (div (+ .cse1 (- 1) c_~cur~0) (- 2)) .cse2) (< (div (+ (- 1) .cse3 c_~cur~0) (- 2)) .cse2) (forall ((v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (<= 2 aux_mod_v_~prev~0_98_49) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) 12 (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) (* 2 c_~j~0) 12)) (<= 2 aux_mod_v_~prev~0_98_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~prev~0_98_49 0)))))) (<= (div (+ .cse1 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse4) (< c_~i~0 .cse5) (< c_~i~0 .cse0) (<= (div (+ .cse3 c_~prev~0 (- 5)) (- 2)) .cse6) (< c_~j~0 .cse5) (<= (div (+ .cse1 c_~prev~0 (- 5)) (- 2)) .cse6) (<= (div (+ .cse3 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse4) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) (* 2 c_~j~0) 12)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 1)) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= 2 aux_mod_v_~prev~0_98_49) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) 8 (* 4 c_~cur~0) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50)))))) is different from false [2021-11-25 19:16:54,997 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (* 2 c_~cur~0))) (let ((.cse2 (+ c_~prev~0 c_~cur~0 1)) (.cse0 (+ c_~prev~0 c_~cur~0)) (.cse5 (+ .cse7 c_~prev~0)) (.cse1 (* c_~j~0 (- 1))) (.cse6 (+ (* 2 c_~prev~0) 2 (* 4 c_~cur~0))) (.cse3 (* c_~i~0 (- 1))) (.cse4 (+ .cse7 c_~prev~0 1))) (and (< c_~j~0 .cse0) (forall ((v_~cur~0_89 Int)) (or (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) 8 (* 2 c_~i~0))) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 1)))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 v_~cur~0_89) (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 4 v_~cur~0_89) (* 2 c_~j~0) 8)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50) (< aux_div_v_~cur~0_86_50 (+ c_~cur~0 v_~cur~0_89 1))))) (< v_~cur~0_89 (+ c_~prev~0 c_~cur~0)))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ (* 2 c_~cur~0) c_~prev~0)) (<= 2 aux_mod_v_~prev~0_98_49) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) 12 (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 1)) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) (* 2 c_~j~0) 8 (* 4 c_~cur~0))) (< aux_mod_v_~cur~0_86_50 0) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~prev~0_98_49))) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50))) (< c_~i~0 c_~cur~0) (< (div (+ .cse1 (- 1) c_~cur~0) (- 2)) .cse2) (< (div (+ (- 1) .cse3 c_~cur~0) (- 2)) .cse2) (forall ((v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int)) (or (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (<= 2 aux_mod_v_~prev~0_98_49) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) 12 (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int)) (or (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) (* 2 c_~j~0) 12)) (<= 2 aux_mod_v_~prev~0_98_49) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~prev~0_98_49 0)))))) (<= (div (+ .cse1 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse4) (< c_~i~0 .cse5) (< c_~i~0 .cse0) (<= (div (+ .cse3 c_~prev~0 (- 5)) (- 2)) .cse6) (< c_~j~0 .cse5) (<= (div (+ .cse1 c_~prev~0 (- 5)) (- 2)) .cse6) (<= (div (+ .cse3 c_~prev~0 c_~cur~0 (- 3)) (- 2)) .cse4) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (v_~cur~0_86 Int)) (or (< v_~cur~0_86 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ 5 c_~j~0 aux_mod_v_~prev~0_98_49) (+ c_~prev~0 c_~cur~0 (* 2 aux_div_v_~prev~0_98_49))) (<= (* 5 aux_div_v_~prev~0_98_49) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 4 v_~cur~0_86) (* 2 c_~j~0) 12)) (<= 2 aux_mod_v_~prev~0_98_49) (< aux_mod_v_~prev~0_98_49 0))) (forall ((aux_div_v_~prev~0_98_49 Int) (aux_mod_v_~prev~0_98_49 Int) (aux_div_v_~cur~0_86_50 Int) (aux_mod_v_~cur~0_86_50 Int)) (or (< aux_div_v_~cur~0_86_50 (+ c_~prev~0 c_~cur~0 1)) (< (+ 5 c_~i~0 aux_mod_v_~prev~0_98_49) (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~prev~0_98_49))) (< aux_mod_v_~cur~0_86_50 0) (<= 2 aux_mod_v_~prev~0_98_49) (<= (+ (* 4 aux_mod_v_~cur~0_86_50) (* 5 aux_div_v_~prev~0_98_49)) (+ (* 2 aux_mod_v_~prev~0_98_49) (* 8 aux_div_v_~cur~0_86_50) 8 (* 4 c_~cur~0) (* 2 c_~i~0))) (< aux_mod_v_~prev~0_98_49 0) (<= 2 aux_mod_v_~cur~0_86_50))) (< c_~j~0 c_~cur~0)))) is different from false [2021-11-25 19:17:28,640 WARN L227 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 72 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)