./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c5f43b3e9ff1d4598a5a525fe9e716f863331c4c517b4b8adb0491943243286 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 19:32:54,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:32:54,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:32:54,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:32:54,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:32:54,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:32:54,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:32:54,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:32:54,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:32:54,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:32:54,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:32:54,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:32:54,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:32:54,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:32:54,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:32:54,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:32:54,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:32:54,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:32:54,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:32:54,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:32:54,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:32:54,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:32:54,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:32:54,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:32:54,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:32:54,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:32:54,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:32:54,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:32:54,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:32:54,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:32:54,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:32:54,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:32:54,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:32:54,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:32:54,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:32:54,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:32:54,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:32:54,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:32:54,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:32:54,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:32:54,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:32:54,147 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:32:54,182 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:32:54,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:32:54,186 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:32:54,187 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:32:54,188 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:32:54,188 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:32:54,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:32:54,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:32:54,189 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:32:54,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:32:54,191 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:32:54,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:32:54,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:32:54,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:32:54,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:32:54,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:32:54,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:32:54,193 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:32:54,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:32:54,193 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:32:54,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:32:54,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:32:54,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:32:54,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:32:54,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:32:54,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:32:54,196 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:32:54,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:32:54,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:32:54,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:32:54,198 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:32:54,198 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:32:54,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:32:54,199 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/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_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c5f43b3e9ff1d4598a5a525fe9e716f863331c4c517b4b8adb0491943243286 [2022-11-18 19:32:54,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:32:54,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:32:54,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:32:54,513 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:32:54,514 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:32:54,516 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c [2022-11-18 19:32:54,589 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/data/e1eab2527/79f63ad570b54e2d9326eafdc1d865df/FLAGa64d22e78 [2022-11-18 19:32:54,998 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:32:54,998 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c [2022-11-18 19:32:55,004 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/data/e1eab2527/79f63ad570b54e2d9326eafdc1d865df/FLAGa64d22e78 [2022-11-18 19:32:55,429 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/data/e1eab2527/79f63ad570b54e2d9326eafdc1d865df [2022-11-18 19:32:55,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:32:55,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:32:55,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:32:55,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:32:55,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:32:55,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36cb761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55, skipping insertion in model container [2022-11-18 19:32:55,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:32:55,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:32:55,683 WARN L234 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_6f967148-89be-4ae2-a63a-30156ee61cd3/sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c[319,332] [2022-11-18 19:32:55,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:32:55,707 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:32:55,719 WARN L234 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_6f967148-89be-4ae2-a63a-30156ee61cd3/sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c[319,332] [2022-11-18 19:32:55,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:32:55,735 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:32:55,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55 WrapperNode [2022-11-18 19:32:55,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:32:55,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:32:55,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:32:55,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:32:55,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,772 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-11-18 19:32:55,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:32:55,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:32:55,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:32:55,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:32:55,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,801 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:32:55,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:32:55,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:32:55,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:32:55,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:32:55,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:32:55,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:32:55,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:32:55,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:32:55,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:32:55,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:32:55,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:32:55,987 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:32:55,989 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:32:56,123 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:32:56,128 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:32:56,129 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 19:32:56,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:32:56 BoogieIcfgContainer [2022-11-18 19:32:56,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:32:56,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:32:56,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:32:56,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:32:56,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:32:55" (1/3) ... [2022-11-18 19:32:56,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6989e07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:32:56, skipping insertion in model container [2022-11-18 19:32:56,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55" (2/3) ... [2022-11-18 19:32:56,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6989e07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:32:56, skipping insertion in model container [2022-11-18 19:32:56,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:32:56" (3/3) ... [2022-11-18 19:32:56,141 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_10.c [2022-11-18 19:32:56,171 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:32:56,171 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:32:56,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:32:56,226 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@aaec2c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:32:56,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 19:32:56,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:32:56,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 19:32:56,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:56,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 19:32:56,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:32:56,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2022-11-18 19:32:56,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:56,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113605914] [2022-11-18 19:32:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:56,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:32:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:32:56,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:32:56,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113605914] [2022-11-18 19:32:56,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113605914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:56,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:56,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:32:56,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463467779] [2022-11-18 19:32:56,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:56,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:32:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:32:56,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:32:56,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:32:56,426 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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) [2022-11-18 19:32:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:56,442 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-11-18 19:32:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:32:56,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 [2022-11-18 19:32:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:56,453 INFO L225 Difference]: With dead ends: 21 [2022-11-18 19:32:56,453 INFO L226 Difference]: Without dead ends: 9 [2022-11-18 19:32:56,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:32:56,460 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:56,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:32:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-18 19:32:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-18 19:32:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:32:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-11-18 19:32:56,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-11-18 19:32:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:56,490 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-18 19:32:56,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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) [2022-11-18 19:32:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-11-18 19:32:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 19:32:56,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:56,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 19:32:56,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:32:56,493 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:32:56,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:56,494 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2022-11-18 19:32:56,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:56,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892173965] [2022-11-18 19:32:56,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:56,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:32:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:32:56,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:32:56,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892173965] [2022-11-18 19:32:56,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892173965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:56,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:56,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:32:56,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998044959] [2022-11-18 19:32:56,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:56,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:32:56,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:32:56,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:32:56,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:32:56,716 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.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) [2022-11-18 19:32:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:56,745 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-11-18 19:32:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:32:56,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.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 [2022-11-18 19:32:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:56,747 INFO L225 Difference]: With dead ends: 19 [2022-11-18 19:32:56,747 INFO L226 Difference]: Without dead ends: 12 [2022-11-18 19:32:56,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:32:56,749 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:56,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:32:56,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-18 19:32:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-11-18 19:32:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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) [2022-11-18 19:32:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-11-18 19:32:56,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2022-11-18 19:32:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:56,755 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-18 19:32:56,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.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) [2022-11-18 19:32:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-11-18 19:32:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 19:32:56,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:56,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:56,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:32:56,757 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:32:56,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:56,758 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2022-11-18 19:32:56,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:56,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958559128] [2022-11-18 19:32:56,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:56,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:32:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:32:57,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:32:57,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958559128] [2022-11-18 19:32:57,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958559128] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:32:57,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656448182] [2022-11-18 19:32:57,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:57,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:32:57,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:32:57,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:32:57,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:32:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:57,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 19:32:57,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:32:57,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:32:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:32:57,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656448182] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:32:57,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:32:57,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2022-11-18 19:32:57,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203487089] [2022-11-18 19:32:57,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:32:57,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:32:57,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:32:57,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:32:57,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:32:57,506 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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) [2022-11-18 19:32:57,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:57,632 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-11-18 19:32:57,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:32:57,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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 9 [2022-11-18 19:32:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:57,635 INFO L225 Difference]: With dead ends: 26 [2022-11-18 19:32:57,635 INFO L226 Difference]: Without dead ends: 19 [2022-11-18 19:32:57,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:32:57,642 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:57,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:32:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-18 19:32:57,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-18 19:32:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 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) [2022-11-18 19:32:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-11-18 19:32:57,662 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2022-11-18 19:32:57,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:57,663 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-18 19:32:57,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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) [2022-11-18 19:32:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-11-18 19:32:57,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 19:32:57,664 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:57,664 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:57,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 19:32:57,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:32:57,870 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:32:57,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:57,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2022-11-18 19:32:57,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:57,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200141433] [2022-11-18 19:32:57,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:57,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:32:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:32:58,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:32:58,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200141433] [2022-11-18 19:32:58,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200141433] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:32:58,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041716765] [2022-11-18 19:32:58,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:32:58,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:32:58,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:32:58,310 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:32:58,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:32:58,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:32:58,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:32:58,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 19:32:58,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:32:58,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:32:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:32:58,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041716765] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:32:58,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:32:58,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 20 [2022-11-18 19:32:58,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286176913] [2022-11-18 19:32:58,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:32:58,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 19:32:58,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:32:58,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 19:32:58,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-11-18 19:32:58,915 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:01,961 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-11-18 19:33:01,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 19:33:01,962 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 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 [2022-11-18 19:33:01,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:01,964 INFO L225 Difference]: With dead ends: 57 [2022-11-18 19:33:01,964 INFO L226 Difference]: Without dead ends: 38 [2022-11-18 19:33:01,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2022-11-18 19:33:01,966 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 60 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:01,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 25 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:33:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-18 19:33:01,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-11-18 19:33:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-11-18 19:33:01,984 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 18 [2022-11-18 19:33:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:01,986 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-11-18 19:33:01,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-11-18 19:33:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 19:33:01,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:01,988 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:01,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:33:02,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:02,193 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:02,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:02,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1843997196, now seen corresponding path program 1 times [2022-11-18 19:33:02,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:02,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837265598] [2022-11-18 19:33:02,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:02,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:02,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837265598] [2022-11-18 19:33:02,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837265598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:02,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20240365] [2022-11-18 19:33:02,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:02,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:02,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:02,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:02,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:33:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:02,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 19:33:02,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:02,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:02,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20240365] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:02,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:33:02,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-11-18 19:33:02,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370338324] [2022-11-18 19:33:02,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:02,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 19:33:02,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:02,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 19:33:02,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-11-18 19:33:02,782 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:03,419 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-11-18 19:33:03,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 19:33:03,422 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 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 24 [2022-11-18 19:33:03,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:03,423 INFO L225 Difference]: With dead ends: 60 [2022-11-18 19:33:03,423 INFO L226 Difference]: Without dead ends: 53 [2022-11-18 19:33:03,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=230, Unknown=0, NotChecked=0, Total=380 [2022-11-18 19:33:03,425 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:03,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 23 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:33:03,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-18 19:33:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-11-18 19:33:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-11-18 19:33:03,443 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 24 [2022-11-18 19:33:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:03,443 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-11-18 19:33:03,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-11-18 19:33:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 19:33:03,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:03,445 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:03,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-18 19:33:03,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:03,646 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:03,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:03,646 INFO L85 PathProgramCache]: Analyzing trace with hash -51731342, now seen corresponding path program 3 times [2022-11-18 19:33:03,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:03,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727735410] [2022-11-18 19:33:03,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:03,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:04,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:04,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727735410] [2022-11-18 19:33:04,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727735410] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:04,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143554481] [2022-11-18 19:33:04,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 19:33:04,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:04,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:04,115 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:04,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 19:33:04,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 19:33:04,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:33:04,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 19:33:04,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-11-18 19:33:04,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-11-18 19:33:04,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143554481] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:04,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:33:04,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 21 [2022-11-18 19:33:04,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634065346] [2022-11-18 19:33:04,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:04,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 19:33:04,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:04,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 19:33:04,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-18 19:33:04,693 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:05,481 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-11-18 19:33:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 19:33:05,482 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-18 19:33:05,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:05,483 INFO L225 Difference]: With dead ends: 57 [2022-11-18 19:33:05,483 INFO L226 Difference]: Without dead ends: 53 [2022-11-18 19:33:05,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2022-11-18 19:33:05,484 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 90 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:05,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 17 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:33:05,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-18 19:33:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-11-18 19:33:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-11-18 19:33:05,496 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 36 [2022-11-18 19:33:05,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:05,496 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-11-18 19:33:05,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:05,497 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-11-18 19:33:05,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 19:33:05,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:05,498 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 3, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:05,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 19:33:05,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:05,698 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:05,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:05,699 INFO L85 PathProgramCache]: Analyzing trace with hash -749374373, now seen corresponding path program 2 times [2022-11-18 19:33:05,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:05,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916004251] [2022-11-18 19:33:05,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:05,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 101 proven. 222 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:33:06,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:06,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916004251] [2022-11-18 19:33:06,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916004251] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:06,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028111496] [2022-11-18 19:33:06,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:33:06,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:06,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:06,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:06,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 19:33:06,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:33:06,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:33:06,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-18 19:33:06,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:06,485 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:06,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:07,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028111496] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:07,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:33:07,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 33 [2022-11-18 19:33:07,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807383089] [2022-11-18 19:33:07,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:07,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-18 19:33:07,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:07,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-18 19:33:07,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=740, Unknown=0, NotChecked=0, Total=1056 [2022-11-18 19:33:07,178 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:27,965 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2022-11-18 19:33:27,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-18 19:33:27,966 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 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 51 [2022-11-18 19:33:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:27,967 INFO L225 Difference]: With dead ends: 121 [2022-11-18 19:33:27,967 INFO L226 Difference]: Without dead ends: 106 [2022-11-18 19:33:27,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=778, Invalid=1384, Unknown=0, NotChecked=0, Total=2162 [2022-11-18 19:33:27,969 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 85 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:27,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 61 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:33:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-18 19:33:27,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-18 19:33:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.0380952380952382) internal successors, (109), 105 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2022-11-18 19:33:27,986 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 51 [2022-11-18 19:33:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:27,986 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2022-11-18 19:33:27,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2022-11-18 19:33:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-18 19:33:27,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:27,989 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 30, 3, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:27,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 19:33:28,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:28,195 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:28,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1404636997, now seen corresponding path program 3 times [2022-11-18 19:33:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:28,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78067533] [2022-11-18 19:33:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:28,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 245 proven. 1365 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:33:29,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:29,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78067533] [2022-11-18 19:33:29,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78067533] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:29,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746807526] [2022-11-18 19:33:29,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 19:33:29,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:29,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:29,754 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:29,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 19:33:29,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-18 19:33:29,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:33:29,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 19:33:29,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 326 proven. 15 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2022-11-18 19:33:30,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 341 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2022-11-18 19:33:32,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746807526] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:32,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:33:32,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 9, 11] total 49 [2022-11-18 19:33:32,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922921415] [2022-11-18 19:33:32,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:32,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-18 19:33:32,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:32,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-18 19:33:32,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2006, Unknown=0, NotChecked=0, Total=2352 [2022-11-18 19:33:32,287 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand has 49 states, 49 states have (on average 2.7142857142857144) internal successors, (133), 49 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:38,725 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2022-11-18 19:33:38,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-18 19:33:38,730 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.7142857142857144) internal successors, (133), 49 states have internal predecessors, (133), 0 states have call successors, (0), 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 105 [2022-11-18 19:33:38,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:38,732 INFO L225 Difference]: With dead ends: 146 [2022-11-18 19:33:38,732 INFO L226 Difference]: Without dead ends: 131 [2022-11-18 19:33:38,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1203, Invalid=6279, Unknown=0, NotChecked=0, Total=7482 [2022-11-18 19:33:38,740 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 252 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 3356 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 3356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:38,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 53 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 3356 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-18 19:33:38,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-18 19:33:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2022-11-18 19:33:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.054263565891473) internal successors, (136), 129 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2022-11-18 19:33:38,760 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 105 [2022-11-18 19:33:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:38,760 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2022-11-18 19:33:38,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.7142857142857144) internal successors, (133), 49 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:38,761 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2022-11-18 19:33:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-18 19:33:38,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:38,763 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 32, 9, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:38,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 19:33:38,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-18 19:33:38,969 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:38,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash 674089979, now seen corresponding path program 4 times [2022-11-18 19:33:38,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:38,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489094551] [2022-11-18 19:33:38,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:38,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 849 proven. 1552 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-18 19:33:40,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:40,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489094551] [2022-11-18 19:33:40,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489094551] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:40,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089586282] [2022-11-18 19:33:40,592 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 19:33:40,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:40,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:40,594 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:40,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f967148-89be-4ae2-a63a-30156ee61cd3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 19:33:40,787 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 19:33:40,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:33:40,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-18 19:33:40,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 774 proven. 1650 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-18 19:33:41,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 774 proven. 1650 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-18 19:33:45,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089586282] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:45,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:33:45,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36, 37] total 72 [2022-11-18 19:33:45,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413035305] [2022-11-18 19:33:45,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:45,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-18 19:33:45,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:45,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-18 19:33:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1400, Invalid=3712, Unknown=0, NotChecked=0, Total=5112 [2022-11-18 19:33:45,152 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand has 72 states, 72 states have (on average 2.986111111111111) internal successors, (215), 72 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:34:47,642 WARN L233 SmtUtils]: Spent 15.44s on a formula simplification. DAG size of input: 239 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:35:47,182 WARN L233 SmtUtils]: Spent 10.96s on a formula simplification. DAG size of input: 232 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:36:56,246 WARN L233 SmtUtils]: Spent 13.12s on a formula simplification. DAG size of input: 225 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:36:58,273 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse2)) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse6)) (< 4294967294 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse10)) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse12)) (< 4294967294 .cse12))) (let ((.cse13 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse20)) (< 4294967294 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse21)) (< 4294967294 .cse21))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse24)) (< 4294967294 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse27)) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29)))) is different from false [2022-11-18 19:37:59,301 WARN L233 SmtUtils]: Spent 7.54s on a formula simplification. DAG size of input: 208 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:38:59,569 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 208 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:39:01,629 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse2)) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse6)) (< 4294967294 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse10)) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse11)) (< 4294967294 .cse11))) (let ((.cse12 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse16)) (< 4294967294 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse19)) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse20)) (< 4294967294 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse22)) (< 4294967294 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse25)) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse28)) (< 4294967294 .cse28)))) is different from false [2022-11-18 19:39:03,739 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse2)) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse6)) (< 4294967294 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse11)) (< 4294967294 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse19)) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse20)) (< 4294967294 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse24)) (< 4294967294 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse27)) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse30)) (< 4294967294 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse32)) (< 4294967294 .cse32)))) is different from false [2022-11-18 19:39:57,022 WARN L233 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 206 DAG size of output: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:39:59,037 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse2)) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse6)) (< 4294967294 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse11)) (< 4294967294 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse19)) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse22)) (< 4294967294 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse25)) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse28)) (< 4294967294 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (or (not (<= 5000000 .cse31)) (< 4294967294 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse32)) (< 4294967294 .cse32)))) is different from false [2022-11-18 19:40:55,070 WARN L233 SmtUtils]: Spent 10.72s on a formula simplification. DAG size of input: 204 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:40:57,106 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse3)) (< 4294967294 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse4)) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse14)) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse15)) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse20)) (< 4294967294 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse21)) (< 4294967294 .cse21))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse24)) (< 4294967294 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26)))) is different from false [2022-11-18 19:42:00,163 WARN L233 SmtUtils]: Spent 7.83s on a formula simplification. DAG size of input: 187 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:43:12,377 WARN L233 SmtUtils]: Spent 8.68s on a formula simplification. DAG size of input: 187 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:43:14,406 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse3)) (< 4294967294 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse4)) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse14)) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse15)) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse20)) (< 4294967294 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse21)) (< 4294967294 .cse21))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse24)) (< 4294967294 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse25)) (< 4294967294 .cse25)))) is different from false [2022-11-18 19:44:32,591 WARN L233 SmtUtils]: Spent 13.15s on a formula simplification. DAG size of input: 185 DAG size of output: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:45:45,855 WARN L233 SmtUtils]: Spent 10.65s on a formula simplification. DAG size of input: 183 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:45:47,885 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse3)) (< 4294967294 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse4)) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse14)) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse15)) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse19)) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse20)) (< 4294967294 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse22)) (< 4294967294 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23)))) is different from false [2022-11-18 19:46:47,731 WARN L233 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 166 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:47:44,128 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 166 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)