./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/jain_5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/jain_5-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8 --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 51f18e80b5b0f6da04af12e6407c1afb08dc9b5e98545aeafa4f330f4ac3434e --- 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-2329fc7 [2022-12-13 20:06:32,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:06:32,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:06:32,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:06:32,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:06:32,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:06:32,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:06:32,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:06:32,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:06:32,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:06:32,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:06:32,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:06:32,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:06:32,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:06:32,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:06:32,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:06:32,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:06:32,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:06:32,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:06:32,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:06:32,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:06:32,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:06:32,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:06:32,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:06:32,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:06:32,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:06:32,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:06:32,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:06:32,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:06:32,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:06:32,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:06:32,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:06:32,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:06:32,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:06:32,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:06:32,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:06:32,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:06:32,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:06:32,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:06:32,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:06:32,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:06:32,199 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 20:06:32,213 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:06:32,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:06:32,214 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:06:32,214 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:06:32,214 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:06:32,215 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:06:32,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:06:32,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:06:32,215 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:06:32,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:06:32,216 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:06:32,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:06:32,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:06:32,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:06:32,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:06:32,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:06:32,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:06:32,217 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:06:32,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:06:32,217 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:06:32,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:06:32,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:06:32,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:06:32,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:06:32,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:06:32,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:06:32,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:06:32,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:06:32,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:06:32,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:06:32,218 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:06:32,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:06:32,219 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:06:32,219 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:06:32,219 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:06:32,219 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/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_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8 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 -> 51f18e80b5b0f6da04af12e6407c1afb08dc9b5e98545aeafa4f330f4ac3434e [2022-12-13 20:06:32,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:06:32,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:06:32,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:06:32,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:06:32,404 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:06:32,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/bitvector/jain_5-2.c [2022-12-13 20:06:34,945 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:06:35,110 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:06:35,111 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/sv-benchmarks/c/bitvector/jain_5-2.c [2022-12-13 20:06:35,116 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/data/42bd1431b/71943db3804244fea147bb51fc7235d9/FLAG751fa9ec1 [2022-12-13 20:06:35,505 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/data/42bd1431b/71943db3804244fea147bb51fc7235d9 [2022-12-13 20:06:35,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:06:35,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:06:35,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:06:35,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:06:35,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:06:35,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:06:35" (1/1) ... [2022-12-13 20:06:35,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167bc1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:06:35, skipping insertion in model container [2022-12-13 20:06:35,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:06:35" (1/1) ... [2022-12-13 20:06:35,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:06:35,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:06:35,622 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/sv-benchmarks/c/bitvector/jain_5-2.c[665,678] [2022-12-13 20:06:35,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:06:35,636 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:06:35,644 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/sv-benchmarks/c/bitvector/jain_5-2.c[665,678] [2022-12-13 20:06:35,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:06:35,654 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:06:35,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:06:35 WrapperNode [2022-12-13 20:06:35,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:06:35,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:06:35,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:06:35,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:06:35,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:06:35" (1/1) ... [2022-12-13 20:06:35,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:06:35" (1/1) ... [2022-12-13 20:06:35,675 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 29 [2022-12-13 20:06:35,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:06:35,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:06:35,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:06:35,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:06:35,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:06:35" (1/1) ... [2022-12-13 20:06:35,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:06:35" (1/1) ... [2022-12-13 20:06:35,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:06:35" (1/1) ... [2022-12-13 20:06:35,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:06:35" (1/1) ... [2022-12-13 20:06:35,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:06:35" (1/1) ... [2022-12-13 20:06:35,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:06:35" (1/1) ... [2022-12-13 20:06:35,686 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:06:35" (1/1) ... [2022-12-13 20:06:35,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:06:35" (1/1) ... [2022-12-13 20:06:35,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:06:35,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:06:35,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:06:35,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:06:35,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:06:35" (1/1) ... [2022-12-13 20:06:35,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:06:35,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:06:35,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:06:35,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:06:35,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:06:35,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:06:35,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:06:35,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:06:35,782 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:06:35,783 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:06:35,833 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:06:35,838 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:06:35,838 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 20:06:35,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:06:35 BoogieIcfgContainer [2022-12-13 20:06:35,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:06:35,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:06:35,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:06:35,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:06:35,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:06:35" (1/3) ... [2022-12-13 20:06:35,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403bb0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:06:35, skipping insertion in model container [2022-12-13 20:06:35,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:06:35" (2/3) ... [2022-12-13 20:06:35,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403bb0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:06:35, skipping insertion in model container [2022-12-13 20:06:35,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:06:35" (3/3) ... [2022-12-13 20:06:35,846 INFO L112 eAbstractionObserver]: Analyzing ICFG jain_5-2.c [2022-12-13 20:06:35,859 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:06:35,859 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 20:06:35,894 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:06:35,899 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;@6bcf5c83, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:06:35,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 20:06:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 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-12-13 20:06:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 20:06:35,906 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:06:35,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 20:06:35,907 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:06:35,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:06:35,911 INFO L85 PathProgramCache]: Analyzing trace with hash 28699754, now seen corresponding path program 1 times [2022-12-13 20:06:35,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:06:35,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641761448] [2022-12-13 20:06:35,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:06:35,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:06:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:06:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:06:36,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:06:36,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641761448] [2022-12-13 20:06:36,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641761448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:06:36,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:06:36,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:06:36,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255808181] [2022-12-13 20:06:36,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:06:36,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:06:36,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:06:36,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:06:36,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:06:36,193 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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-12-13 20:06:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:06:36,217 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2022-12-13 20:06:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:06:36,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-12-13 20:06:36,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:06:36,225 INFO L225 Difference]: With dead ends: 18 [2022-12-13 20:06:36,225 INFO L226 Difference]: Without dead ends: 9 [2022-12-13 20:06:36,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:06:36,229 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:06:36,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 13 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:06:36,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-12-13 20:06:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-12-13 20:06:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 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-12-13 20:06:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-12-13 20:06:36,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2022-12-13 20:06:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:06:36,253 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-12-13 20:06:36,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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-12-13 20:06:36,253 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-12-13 20:06:36,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 20:06:36,253 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:06:36,253 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-13 20:06:36,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:06:36,254 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:06:36,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:06:36,254 INFO L85 PathProgramCache]: Analyzing trace with hash 300686882, now seen corresponding path program 1 times [2022-12-13 20:06:36,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:06:36,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054612426] [2022-12-13 20:06:36,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:06:36,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:06:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:06:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:06:36,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:06:36,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054612426] [2022-12-13 20:06:36,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054612426] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:06:36,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583393430] [2022-12-13 20:06:36,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:06:36,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:06:36,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:06:36,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:06:36,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 20:06:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:06:36,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 20:06:36,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:06:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:06:36,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:06:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:06:36,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583393430] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:06:36,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:06:36,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-12-13 20:06:36,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721502653] [2022-12-13 20:06:36,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:06:36,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:06:36,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:06:36,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:06:36,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:06:36,776 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-12-13 20:06:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:06:36,850 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-12-13 20:06:36,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:06:36,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 8 [2022-12-13 20:06:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:06:36,851 INFO L225 Difference]: With dead ends: 22 [2022-12-13 20:06:36,851 INFO L226 Difference]: Without dead ends: 20 [2022-12-13 20:06:36,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:06:36,853 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:06:36,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:06:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-12-13 20:06:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-12-13 20:06:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 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-12-13 20:06:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-12-13 20:06:36,859 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2022-12-13 20:06:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:06:36,859 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-12-13 20:06:36,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-12-13 20:06:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-12-13 20:06:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 20:06:36,860 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:06:36,860 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2022-12-13 20:06:36,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:06:37,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:06:37,062 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:06:37,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:06:37,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1156434326, now seen corresponding path program 2 times [2022-12-13 20:06:37,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:06:37,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844632516] [2022-12-13 20:06:37,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:06:37,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:06:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:06:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:06:37,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:06:37,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844632516] [2022-12-13 20:06:37,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844632516] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:06:37,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918175373] [2022-12-13 20:06:37,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:06:37,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:06:37,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:06:37,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:06:37,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 20:06:37,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:06:37,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:06:37,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 20:06:37,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:06:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:06:37,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:06:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:06:37,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918175373] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:06:37,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:06:37,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2022-12-13 20:06:37,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842598015] [2022-12-13 20:06:37,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:06:37,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 20:06:37,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:06:37,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 20:06:37,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-12-13 20:06:37,936 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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-12-13 20:06:46,065 WARN L233 SmtUtils]: Spent 7.60s on a formula simplification. DAG size of input: 43 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:06:48,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:06:52,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:06:54,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:06:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:06:55,045 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-12-13 20:06:55,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 20:06:55,045 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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 17 [2022-12-13 20:06:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:06:55,046 INFO L225 Difference]: With dead ends: 40 [2022-12-13 20:06:55,046 INFO L226 Difference]: Without dead ends: 38 [2022-12-13 20:06:55,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2022-12-13 20:06:55,048 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-12-13 20:06:55,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 62 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 6.7s Time] [2022-12-13 20:06:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-13 20:06:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-12-13 20:06:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:06:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-12-13 20:06:55,059 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 17 [2022-12-13 20:06:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:06:55,060 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-12-13 20:06:55,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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-12-13 20:06:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-12-13 20:06:55,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 20:06:55,061 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:06:55,061 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2022-12-13 20:06:55,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 20:06:55,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:06:55,262 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:06:55,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:06:55,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1353352554, now seen corresponding path program 3 times [2022-12-13 20:06:55,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:06:55,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576801878] [2022-12-13 20:06:55,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:06:55,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:06:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:06:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:06:55,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:06:55,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576801878] [2022-12-13 20:06:55,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576801878] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:06:55,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725741115] [2022-12-13 20:06:55,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:06:55,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:06:55,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:06:55,649 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:06:55,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 20:06:57,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-12-13 20:06:57,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:06:57,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 20:06:57,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:06:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:06:58,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:06:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:06:58,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725741115] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:06:58,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:06:58,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2022-12-13 20:06:58,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690694228] [2022-12-13 20:06:58,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:06:58,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 20:06:58,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:06:58,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 20:06:58,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2022-12-13 20:06:58,498 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 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-12-13 20:07:00,806 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30))) is different from false [2022-12-13 20:07:02,815 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30))) is different from false [2022-12-13 20:07:04,827 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30))) is different from false [2022-12-13 20:07:06,835 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30))) is different from false [2022-12-13 20:08:00,477 WARN L233 SmtUtils]: Spent 31.55s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:08:02,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:08:04,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:08:06,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:08:08,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:08:10,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:08:12,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:08:14,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:08:16,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:08:18,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:08:20,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:08:22,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:08:58,947 WARN L233 SmtUtils]: Spent 22.14s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:09:00,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:03,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:05,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:07,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:09,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:11,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:13,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:15,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:17,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:19,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:38,162 WARN L233 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:09:40,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:42,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:44,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:46,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:48,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:50,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:52,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:54,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:56,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:09:58,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:00,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:01,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:03,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:18,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:20,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:22,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:24,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:26,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:28,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:29,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:39,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:41,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:43,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:45,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:47,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:53,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:10:55,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:10:55,225 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-12-13 20:10:55,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 20:10:55,225 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 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 35 [2022-12-13 20:10:55,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:10:55,226 INFO L225 Difference]: With dead ends: 73 [2022-12-13 20:10:55,226 INFO L226 Difference]: Without dead ends: 71 [2022-12-13 20:10:55,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 140.5s TimeCoverageRelationStatistics Valid=569, Invalid=2282, Unknown=27, NotChecked=428, Total=3306 [2022-12-13 20:10:55,228 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 73 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 19 mSolverCounterUnsat, 43 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 96.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 43 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 96.8s IncrementalHoareTripleChecker+Time [2022-12-13 20:10:55,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 198 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 330 Invalid, 43 Unknown, 6 Unchecked, 96.8s Time] [2022-12-13 20:10:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-13 20:10:55,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-12-13 20:10:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 0 states have call successors, (0), 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-12-13 20:10:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2022-12-13 20:10:55,248 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 35 [2022-12-13 20:10:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:10:55,248 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2022-12-13 20:10:55,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 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-12-13 20:10:55,249 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-12-13 20:10:55,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 20:10:55,250 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:10:55,250 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1] [2022-12-13 20:10:55,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 20:10:55,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:10:55,451 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:10:55,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:10:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1882756062, now seen corresponding path program 4 times [2022-12-13 20:10:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:10:55,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969445050] [2022-12-13 20:10:55,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:10:55,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:10:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:10:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:10:56,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:10:56,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969445050] [2022-12-13 20:10:56,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969445050] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:10:56,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257688369] [2022-12-13 20:10:56,304 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 20:10:56,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:10:56,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:10:56,305 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:10:56,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921ecc36-ac65-4229-b4a5-cffd16a01462/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 20:10:56,355 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 20:10:56,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:10:56,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 101 conjunts are in the unsatisfiable core [2022-12-13 20:10:56,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:10:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:10:57,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:12:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 670 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:12:06,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257688369] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:12:06,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:12:06,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 71 [2022-12-13 20:12:06,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584614500] [2022-12-13 20:12:06,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:12:06,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-12-13 20:12:06,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:12:06,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-12-13 20:12:06,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=817, Invalid=4146, Unknown=7, NotChecked=0, Total=4970 [2022-12-13 20:12:06,205 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 71 states, 71 states have (on average 2.788732394366197) internal successors, (198), 71 states have internal predecessors, (198), 0 states have call successors, (0), 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-12-13 20:12:09,096 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) (.cse11 (= 30 (mod (+ 840 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 21)) 4294967296))) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) (.cse16 (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30)) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse13 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse8 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse19 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse14 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse12 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse15 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse17 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse18 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse20 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not .cse6) .cse7) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (or (not .cse8) .cse9) (not .cse10) (or (not .cse11) .cse6) (or .cse12 (not .cse13)) (or (not .cse14) .cse15) (or .cse11 (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 924 (* |c_ULTIMATE.start_main_~y~0#1| 22)) 4294967296)))) (or .cse1 (not .cse16)) (or (not .cse7) .cse16) (or (not .cse17) .cse10) (or .cse18 (not .cse19)) (or (not .cse9) .cse13) (or (not .cse0) .cse8) (or (not .cse20) .cse19) (or .cse5 (not .cse3)) (or .cse14 (not .cse12)) (or .cse2 (not .cse15)) (or .cse17 (not .cse18)) (or .cse20 (not .cse4)))) is different from false [2022-12-13 20:12:11,107 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) (.cse15 (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30)) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse12 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse8 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse18 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse13 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse11 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse14 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse16 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse17 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse19 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not .cse6) .cse7) (or (not .cse8) .cse9) (not .cse10) (or (not (= 30 (mod (+ 840 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 21)) 4294967296))) .cse6) (or .cse11 (not .cse12)) (or (not .cse13) .cse14) (or .cse1 (not .cse15)) (or (not .cse7) .cse15) (or (not .cse16) .cse10) (or .cse17 (not .cse18)) (or (not .cse9) .cse12) (or (not .cse0) .cse8) (or (not .cse19) .cse18) (or .cse5 (not .cse3)) (or .cse13 (not .cse11)) (or .cse2 (not .cse14)) (or .cse16 (not .cse17)) (or .cse19 (not .cse4)))) is different from false [2022-12-13 20:12:13,119 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) (.cse15 (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30)) (.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse12 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse5 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse9 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse18 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse13 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse11 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse14 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse16 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse17 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse19 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or (not .cse4) .cse5) (or .cse6 (not .cse7)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) .cse8) (or (not .cse9) .cse10) (or .cse11 (not .cse12)) (or (not .cse13) .cse14) (or .cse1 (not .cse15)) (or (not .cse8) .cse15) (or (not .cse16) .cse4) (or .cse17 (not .cse18)) (or (not .cse10) .cse12) (not .cse5) (or (not .cse0) .cse9) (or (not .cse19) .cse18) (or .cse7 (not .cse3)) (or .cse13 (not .cse11)) (or .cse2 (not .cse14)) (or .cse16 (not .cse17)) (or .cse19 (not .cse6)))) is different from false [2022-12-13 20:12:15,154 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) (.cse14 (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30)) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse11 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse7 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse17 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse12 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse13 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse15 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse16 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse18 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) .cse6) (or (not .cse7) .cse8) (not .cse9) (or .cse10 (not .cse11)) (or (not .cse12) .cse13) (or .cse1 (not .cse14)) (or (not .cse6) .cse14) (or (not .cse15) .cse9) (or .cse16 (not .cse17)) (or (not .cse8) .cse11) (or (not .cse0) .cse7) (or (not .cse18) .cse17) (or .cse5 (not .cse3)) (or .cse12 (not .cse10)) (or .cse2 (not .cse13)) (or .cse15 (not .cse16)) (or .cse18 (not .cse4)))) is different from false [2022-12-13 20:12:17,168 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse14 (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30)) (.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse11 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse5 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse8 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse17 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse12 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse13 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse15 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse16 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse18 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or (not .cse4) .cse5) (or .cse6 (not .cse7)) (or (not .cse8) .cse9) (or .cse10 (not .cse11)) (or (not .cse12) .cse13) (or .cse1 (not .cse14)) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse14) (or (not .cse15) .cse4) (or .cse16 (not .cse17)) (or (not .cse9) .cse11) (not .cse5) (or (not .cse0) .cse8) (or (not .cse18) .cse17) (or .cse7 (not .cse3)) (or .cse12 (not .cse10)) (or .cse2 (not .cse13)) (or .cse15 (not .cse16)) (or .cse18 (not .cse6)))) is different from false [2022-12-13 20:12:19,178 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse13 (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30)) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse6 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse16 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse11 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse12 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse14 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse15 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse17 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not .cse6) .cse7) (not .cse8) (or .cse9 (not .cse10)) (or (not .cse11) .cse12) (or .cse1 (not .cse13)) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse13) (or (not .cse14) .cse8) (or .cse15 (not .cse16)) (or (not .cse7) .cse10) (or (not .cse0) .cse6) (or (not .cse17) .cse16) (or .cse5 (not .cse3)) (or .cse11 (not .cse9)) (or .cse2 (not .cse12)) (or .cse14 (not .cse15)) (or .cse17 (not .cse4)))) is different from false [2022-12-13 20:12:21,191 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse11 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse5 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse8 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse16 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse12 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse13 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse14 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse15 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse17 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or (not .cse4) .cse5) (or .cse6 (not .cse7)) (or (not .cse8) .cse9) (or .cse10 (not .cse11)) (or (not .cse12) .cse13) (or .cse1 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (or (not .cse14) .cse4) (or .cse15 (not .cse16)) (or (not .cse9) .cse11) (not .cse5) (or (not .cse0) .cse8) (or (not .cse17) .cse16) (or .cse7 (not .cse3)) (or .cse12 (not .cse10)) (or .cse2 (not .cse13)) (or .cse14 (not .cse15)) (or .cse17 (not .cse6)))) is different from false [2022-12-13 20:12:23,205 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse6 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse15 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse11 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse12 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse13 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse14 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse16 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not .cse6) .cse7) (not .cse8) (or .cse9 (not .cse10)) (or (not .cse11) .cse12) (or .cse1 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (or (not .cse13) .cse8) (or .cse14 (not .cse15)) (or (not .cse7) .cse10) (or (not .cse0) .cse6) (or (not .cse16) .cse15) (or .cse5 (not .cse3)) (or .cse11 (not .cse9)) (or .cse2 (not .cse12)) (or .cse13 (not .cse14)) (or .cse16 (not .cse4)))) is different from false [2022-12-13 20:12:25,221 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse4 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse7 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse15 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse2 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse11 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse1 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse12 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse13 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse14 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse16 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or (not .cse1) .cse2) (or (not .cse3) .cse4) (or .cse5 (not .cse6)) (or (not .cse7) .cse8) (or .cse9 (not .cse10)) (or (not .cse11) .cse12) (or (not .cse13) .cse3) (or .cse14 (not .cse15)) (or (not .cse8) .cse10) (not .cse4) (or (not .cse0) .cse7) (or (not .cse16) .cse15) (or .cse6 (not .cse2)) (or .cse11 (not .cse9)) (or .cse1 (not .cse12)) (or .cse13 (not .cse14)) (or .cse16 (not .cse5)))) is different from false [2022-12-13 20:12:27,230 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse5 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse14 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse2 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse10 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse1 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse11 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse12 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse13 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse15 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or (not .cse1) .cse2) (or .cse3 (not .cse4)) (or (not .cse5) .cse6) (not .cse7) (or .cse8 (not .cse9)) (or (not .cse10) .cse11) (or (not .cse12) .cse7) (or .cse13 (not .cse14)) (or (not .cse6) .cse9) (or (not .cse0) .cse5) (or (not .cse15) .cse14) (or .cse4 (not .cse2)) (or .cse10 (not .cse8)) (or .cse1 (not .cse11)) (or .cse12 (not .cse13)) (or .cse15 (not .cse3)))) is different from false [2022-12-13 20:12:29,248 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse3 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse6 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse14 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse10 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse11 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse12 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse13 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse15 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not .cse6) .cse7) (or .cse8 (not .cse9)) (or (not .cse10) .cse11) (or (not .cse12) .cse2) (or .cse13 (not .cse14)) (or (not .cse7) .cse9) (not .cse3) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse6) (or (not .cse15) .cse14) (or .cse5 (not .cse1)) (or .cse10 (not .cse8)) (or .cse0 (not .cse11)) (or .cse12 (not .cse13)) (or .cse15 (not .cse4)))) is different from false [2022-12-13 20:12:31,260 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse5 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse4 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse13 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse10 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse11 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse12 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse14 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or .cse2 (not .cse3)) (or (not .cse4) .cse5) (not .cse6) (or .cse7 (not .cse8)) (or (not .cse9) .cse10) (or (not .cse11) .cse6) (or .cse12 (not .cse13)) (or (not .cse5) .cse8) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse4) (or (not .cse14) .cse13) (or .cse3 (not .cse1)) (or .cse9 (not .cse7)) (or .cse0 (not .cse10)) (or .cse11 (not .cse12)) (or .cse14 (not .cse2)))) is different from false [2022-12-13 20:12:33,273 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse3 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse13 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse10 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse11 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse12 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse14 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) .cse6) (or .cse7 (not .cse8)) (or (not .cse9) .cse10) (or (not .cse11) .cse2) (or .cse12 (not .cse13)) (or (not .cse6) .cse8) (not .cse3) (or (not .cse14) .cse13) (or .cse5 (not .cse1)) (or .cse9 (not .cse7)) (or .cse0 (not .cse10)) (or .cse11 (not .cse12)) (or .cse14 (not .cse4)))) is different from false [2022-12-13 20:12:35,281 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse12 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse9 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse10 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse11 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse13 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or .cse2 (not .cse3)) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) .cse4) (not .cse5) (or .cse6 (not .cse7)) (or (not .cse8) .cse9) (or (not .cse10) .cse5) (or .cse11 (not .cse12)) (or (not .cse4) .cse7) (or (not .cse13) .cse12) (or .cse3 (not .cse1)) (or .cse8 (not .cse6)) (or .cse0 (not .cse9)) (or .cse10 (not .cse11)) (or .cse13 (not .cse2)))) is different from false [2022-12-13 20:12:37,295 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse3 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse12 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse9 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse10 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse11 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse13 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or .cse6 (not .cse7)) (or (not .cse8) .cse9) (or (not .cse10) .cse2) (or .cse11 (not .cse12)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse7) (not .cse3) (or (not .cse13) .cse12) (or .cse5 (not .cse1)) (or .cse8 (not .cse6)) (or .cse0 (not .cse9)) (or .cse10 (not .cse11)) (or .cse13 (not .cse4)))) is different from false [2022-12-13 20:12:39,305 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse11 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse5 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse8 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse10 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse12 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or .cse2 (not .cse3)) (not .cse4) (or .cse5 (not .cse6)) (or (not .cse7) .cse8) (or (not .cse9) .cse4) (or .cse10 (not .cse11)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse6) (or (not .cse12) .cse11) (or .cse3 (not .cse1)) (or .cse7 (not .cse5)) (or .cse0 (not .cse8)) (or .cse9 (not .cse10)) (or .cse12 (not .cse2)))) is different from false [2022-12-13 20:12:41,318 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse3 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse11 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse8 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse10 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse12 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or .cse6 (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296)))) (or (not .cse7) .cse8) (or (not .cse9) .cse2) (or .cse10 (not .cse11)) (not .cse3) (or (not .cse12) .cse11) (or .cse5 (not .cse1)) (or .cse7 (not .cse6)) (or .cse0 (not .cse8)) (or .cse9 (not .cse10)) (or .cse12 (not .cse4)))) is different from false [2022-12-13 20:12:43,330 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse5 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse7 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse11 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or .cse2 (not .cse3)) (not .cse4) (or .cse5 (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296)))) (or (not .cse6) .cse7) (or (not .cse8) .cse4) (or .cse9 (not .cse10)) (or (not .cse11) .cse10) (or .cse3 (not .cse1)) (or .cse6 (not .cse5)) (or .cse0 (not .cse7)) (or .cse8 (not .cse9)) (or .cse11 (not .cse2)))) is different from false [2022-12-13 20:12:45,340 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse3 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse7 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse11 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not .cse6) .cse7) (or (not .cse8) .cse2) (or .cse9 (not .cse10)) (not .cse3) (or (not .cse11) .cse10) (or .cse5 (not .cse1)) (or .cse6 (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296)))) (or .cse0 (not .cse7)) (or .cse8 (not .cse9)) (or .cse11 (not .cse4)))) is different from false [2022-12-13 20:12:47,350 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse6 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse10 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or .cse2 (not .cse3)) (not .cse4) (or (not .cse5) .cse6) (or (not .cse7) .cse4) (or .cse8 (not .cse9)) (or (not .cse10) .cse9) (or .cse3 (not .cse1)) (or .cse5 (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296)))) (or .cse0 (not .cse6)) (or .cse7 (not .cse8)) (or .cse10 (not .cse2)))) is different from false [2022-12-13 20:12:49,360 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse3 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse6 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse10 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse6) (or (not .cse7) .cse2) (or .cse8 (not .cse9)) (not .cse3) (or (not .cse10) .cse9) (or .cse5 (not .cse1)) (or .cse0 (not .cse6)) (or .cse7 (not .cse8)) (or .cse10 (not .cse4)))) is different from false [2022-12-13 20:12:51,369 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse5 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse9 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or .cse2 (not .cse3)) (not .cse4) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse5) (or (not .cse6) .cse4) (or .cse7 (not .cse8)) (or (not .cse9) .cse8) (or .cse3 (not .cse1)) (or .cse0 (not .cse5)) (or .cse6 (not .cse7)) (or .cse9 (not .cse2)))) is different from false [2022-12-13 20:12:53,393 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse3 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse9 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not .cse6) .cse2) (or .cse7 (not .cse8)) (not .cse3) (or (not .cse9) .cse8) (or .cse5 (not .cse1)) (or .cse0 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30))) (or .cse6 (not .cse7)) (or .cse9 (not .cse4)))) is different from false [2022-12-13 20:12:55,402 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse8 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or .cse2 (not .cse3)) (not .cse4) (or (not .cse5) .cse4) (or .cse6 (not .cse7)) (or (not .cse8) .cse7) (or .cse3 (not .cse1)) (or .cse0 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30))) (or .cse5 (not .cse6)) (or .cse8 (not .cse2)))) is different from false [2022-12-13 20:12:57,415 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse2 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse0 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse8 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) .cse0) (or (not .cse1) .cse2) (or .cse3 (not .cse4)) (or (not .cse5) .cse1) (or .cse6 (not .cse7)) (not .cse2) (or (not .cse8) .cse7) (or .cse4 (not .cse0)) (or .cse5 (not .cse6)) (or .cse8 (not .cse3)))) is different from false [2022-12-13 20:12:59,424 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse0 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse7 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) .cse0) (or .cse1 (not .cse2)) (not .cse3) (or (not .cse4) .cse3) (or .cse5 (not .cse6)) (or (not .cse7) .cse6) (or .cse2 (not .cse0)) (or .cse4 (not .cse5)) (or .cse7 (not .cse1)))) is different from false [2022-12-13 20:13:01,439 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse7 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or .cse2 (not .cse3)) (or (not .cse4) .cse0) (or .cse5 (not .cse6)) (not .cse1) (or (not .cse7) .cse6) (or .cse3 (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296)))) (or .cse4 (not .cse5)) (or .cse7 (not .cse2)))) is different from false [2022-12-13 20:15:26,423 WARN L233 SmtUtils]: Spent 1.41m on a formula simplification. DAG size of input: 64 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:15:28,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:30,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:32,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:34,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:36,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:38,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:40,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:42,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:44,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:46,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:48,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:50,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:52,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:54,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:56,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:15:58,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:00,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:02,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:04,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:06,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:08,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:10,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:12,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:14,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:16,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:18,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:20,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:22,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:24,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:26,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:16:28,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:10,713 WARN L233 SmtUtils]: Spent 57.60s on a formula simplification. DAG size of input: 59 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:18:12,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:14,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:16,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:18,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:20,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:22,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:24,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:26,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:28,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:30,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:32,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:34,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:36,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:38,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:40,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:42,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:44,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:46,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:48,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:50,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:52,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:54,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:56,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:18:58,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:00,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:02,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:04,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:06,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:08,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:10,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:12,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:14,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:16,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:18,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:20,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:22,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:24,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:26,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:28,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:30,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:32,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:34,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:36,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:19:38,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:20:50,244 WARN L233 SmtUtils]: Spent 38.97s on a formula simplification. DAG size of input: 54 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:20:52,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:20:54,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:20:56,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:20:58,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:21:00,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:21:02,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:21:04,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:21:06,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:21:08,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:21:10,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:21:12,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:21:14,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:21:16,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:21:18,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:21:20,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:21:22,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []