./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 0e0057cc 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_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/jain_5-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:01:34,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:01:34,932 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:01:34,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:01:34,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:01:34,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:01:34,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:01:34,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:01:34,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:01:34,967 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:01:34,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:01:34,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:01:34,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:01:34,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:01:34,970 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:01:34,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:01:34,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:01:34,971 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:01:34,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:01:34,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:01:34,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:01:34,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:01:34,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:01:34,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:01:34,974 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:01:34,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:01:34,975 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:01:34,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:01:34,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:01:34,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:01:34,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:01:34,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:01:34,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:01:34,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:01:34,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:01:34,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:01:34,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:01:34,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:01:34,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:01:34,981 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:01:34,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:01:34,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:01:34,982 INFO L153 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_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/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_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 [2023-11-29 05:01:35,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:01:35,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:01:35,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:01:35,250 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:01:35,250 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:01:35,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/bitvector/jain_5-2.c [2023-11-29 05:01:38,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:01:38,153 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:01:38,153 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/sv-benchmarks/c/bitvector/jain_5-2.c [2023-11-29 05:01:38,159 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/data/fd1c99778/6247a886889c431c9df078397bee68ca/FLAG7ee89e70a [2023-11-29 05:01:38,170 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/data/fd1c99778/6247a886889c431c9df078397bee68ca [2023-11-29 05:01:38,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:01:38,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:01:38,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:01:38,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:01:38,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:01:38,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:01:38" (1/1) ... [2023-11-29 05:01:38,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@689f43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38, skipping insertion in model container [2023-11-29 05:01:38,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:01:38" (1/1) ... [2023-11-29 05:01:38,196 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:01:38,305 WARN L240 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_17da749b-96c1-45d1-b9a2-171a9d2f384f/sv-benchmarks/c/bitvector/jain_5-2.c[665,678] [2023-11-29 05:01:38,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:01:38,322 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:01:38,332 WARN L240 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_17da749b-96c1-45d1-b9a2-171a9d2f384f/sv-benchmarks/c/bitvector/jain_5-2.c[665,678] [2023-11-29 05:01:38,335 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:01:38,346 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:01:38,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38 WrapperNode [2023-11-29 05:01:38,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:01:38,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:01:38,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:01:38,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:01:38,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38" (1/1) ... [2023-11-29 05:01:38,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38" (1/1) ... [2023-11-29 05:01:38,372 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 28 [2023-11-29 05:01:38,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:01:38,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:01:38,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:01:38,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:01:38,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38" (1/1) ... [2023-11-29 05:01:38,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38" (1/1) ... [2023-11-29 05:01:38,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38" (1/1) ... [2023-11-29 05:01:38,391 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 05:01:38,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38" (1/1) ... [2023-11-29 05:01:38,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38" (1/1) ... [2023-11-29 05:01:38,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38" (1/1) ... [2023-11-29 05:01:38,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38" (1/1) ... [2023-11-29 05:01:38,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38" (1/1) ... [2023-11-29 05:01:38,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38" (1/1) ... [2023-11-29 05:01:38,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:01:38,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:01:38,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:01:38,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:01:38,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38" (1/1) ... [2023-11-29 05:01:38,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:01:38,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:01:38,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:01:38,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:01:38,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:01:38,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:01:38,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:01:38,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:01:38,536 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:01:38,538 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:01:38,598 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:01:38,619 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:01:38,620 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:01:38,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:01:38 BoogieIcfgContainer [2023-11-29 05:01:38,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:01:38,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:01:38,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:01:38,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:01:38,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:01:38" (1/3) ... [2023-11-29 05:01:38,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f831977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:01:38, skipping insertion in model container [2023-11-29 05:01:38,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:01:38" (2/3) ... [2023-11-29 05:01:38,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f831977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:01:38, skipping insertion in model container [2023-11-29 05:01:38,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:01:38" (3/3) ... [2023-11-29 05:01:38,629 INFO L112 eAbstractionObserver]: Analyzing ICFG jain_5-2.c [2023-11-29 05:01:38,643 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:01:38,644 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:01:38,683 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:01:38,689 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=LoopHeads, 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;@31189e65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:01:38,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:01:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:01:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 05:01:38,697 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:01:38,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 05:01:38,698 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:01:38,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:01:38,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1858063, now seen corresponding path program 1 times [2023-11-29 05:01:38,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:01:38,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527170128] [2023-11-29 05:01:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:01:38,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:01:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:01:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:01:38,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:01:38,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527170128] [2023-11-29 05:01:38,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527170128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:01:38,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:01:38,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:01:38,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182574419] [2023-11-29 05:01:38,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:01:38,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:01:38,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:01:39,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:01:39,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:01:39,020 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-11-29 05:01:39,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:01:39,050 INFO L93 Difference]: Finished difference Result 15 states and 23 transitions. [2023-11-29 05:01:39,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:01:39,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2023-11-29 05:01:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:01:39,061 INFO L225 Difference]: With dead ends: 15 [2023-11-29 05:01:39,061 INFO L226 Difference]: Without dead ends: 8 [2023-11-29 05:01:39,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:01:39,068 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:01:39,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 7 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:01:39,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-29 05:01:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-29 05:01:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2023-11-29 05:01:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-11-29 05:01:39,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-11-29 05:01:39,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:01:39,102 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-11-29 05:01:39,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-11-29 05:01:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-11-29 05:01:39,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 05:01:39,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:01:39,104 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-11-29 05:01:39,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:01:39,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:01:39,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:01:39,105 INFO L85 PathProgramCache]: Analyzing trace with hash -476212643, now seen corresponding path program 1 times [2023-11-29 05:01:39,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:01:39,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931985281] [2023-11-29 05:01:39,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:01:39,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:01:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:01:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:01:39,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:01:39,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931985281] [2023-11-29 05:01:39,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931985281] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:01:39,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074360768] [2023-11-29 05:01:39,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:01:39,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:01:39,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:01:39,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:01:39,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:01:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:01:39,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 05:01:39,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:01:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:01:39,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:01:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:01:39,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074360768] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:01:39,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:01:39,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2023-11-29 05:01:39,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178288019] [2023-11-29 05:01:39,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:01:39,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:01:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:01:39,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:01:39,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:01:39,593 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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) [2023-11-29 05:01:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:01:39,740 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2023-11-29 05:01:39,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:01:39,741 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 05:01:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:01:39,742 INFO L225 Difference]: With dead ends: 20 [2023-11-29 05:01:39,742 INFO L226 Difference]: Without dead ends: 18 [2023-11-29 05:01:39,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:01:39,744 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:01:39,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 12 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:01:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-29 05:01:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2023-11-29 05:01:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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) [2023-11-29 05:01:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-11-29 05:01:39,751 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 7 [2023-11-29 05:01:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:01:39,751 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-11-29 05:01:39,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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) [2023-11-29 05:01:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-11-29 05:01:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 05:01:39,753 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:01:39,753 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2023-11-29 05:01:39,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:01:39,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-29 05:01:39,957 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:01:39,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:01:39,957 INFO L85 PathProgramCache]: Analyzing trace with hash -726641521, now seen corresponding path program 2 times [2023-11-29 05:01:39,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:01:39,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22150601] [2023-11-29 05:01:39,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:01:39,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:01:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:01:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:01:40,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:01:40,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22150601] [2023-11-29 05:01:40,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22150601] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:01:40,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625307684] [2023-11-29 05:01:40,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:01:40,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:01:40,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:01:40,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:01:40,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:01:40,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:01:40,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:01:40,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 05:01:40,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:01:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:01:40,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:01:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:01:41,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625307684] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:01:41,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:01:41,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2023-11-29 05:01:41,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062761491] [2023-11-29 05:01:41,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:01:41,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 05:01:41,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:01:41,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 05:01:41,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2023-11-29 05:01:41,046 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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) [2023-11-29 05:01:47,762 WARN L293 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 43 DAG size of output: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:01:57,317 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification. DAG size of input: 40 DAG size of output: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:02:04,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:02:05,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:02:05,016 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-11-29 05:02:05,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 05:02:05,017 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 05:02:05,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:02:05,018 INFO L225 Difference]: With dead ends: 38 [2023-11-29 05:02:05,018 INFO L226 Difference]: Without dead ends: 36 [2023-11-29 05:02:05,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2023-11-29 05:02:05,021 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:02:05,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 60 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 05:02:05,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-29 05:02:05,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2023-11-29 05:02:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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) [2023-11-29 05:02:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2023-11-29 05:02:05,030 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 16 [2023-11-29 05:02:05,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:02:05,031 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2023-11-29 05:02:05,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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) [2023-11-29 05:02:05,031 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2023-11-29 05:02:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:02:05,033 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:02:05,033 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1] [2023-11-29 05:02:05,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:02:05,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-29 05:02:05,237 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:02:05,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:02:05,237 INFO L85 PathProgramCache]: Analyzing trace with hash 803030095, now seen corresponding path program 3 times [2023-11-29 05:02:05,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:02:05,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511080905] [2023-11-29 05:02:05,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:02:05,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:02:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:02:05,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:02:05,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511080905] [2023-11-29 05:02:05,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511080905] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:02:05,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219534850] [2023-11-29 05:02:05,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:02:05,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:02:05,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:02:05,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:02:05,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:02:26,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-29 05:02:26,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:02:26,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-29 05:02:26,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:02:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:02:26,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:02:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:02:27,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219534850] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:02:27,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:02:27,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2023-11-29 05:02:27,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789589276] [2023-11-29 05:02:27,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:02:27,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-29 05:02:27,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:02:27,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 05:02:27,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 05:02:27,262 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 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) [2023-11-29 05:02:31,606 WARN L854 $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 [2023-11-29 05:02:35,615 WARN L854 $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 [2023-11-29 05:02:39,629 WARN L854 $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 [2023-11-29 05:02:43,637 WARN L854 $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 [2023-11-29 05:04:07,526 WARN L293 SmtUtils]: Spent 49.96s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:04:09,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:04:13,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:04:17,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:04:21,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:04:24,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:04:28,908 WARN L854 $PredicateComparison]: unable to prove that (and (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 [2023-11-29 05:05:19,700 WARN L293 SmtUtils]: Spent 38.08s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:05:23,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:05:27,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:05:31,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:05:35,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:06:20,784 WARN L293 SmtUtils]: Spent 24.79s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:06:24,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:06:28,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:06:32,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:06:36,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:06:40,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:06:44,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:07:21,064 WARN L293 SmtUtils]: Spent 17.91s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:07:25,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:07:27,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:07:31,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:07:32,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:07:36,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:08:17,815 WARN L293 SmtUtils]: Spent 18.81s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:08:21,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:08:25,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:08:29,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:08:33,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:08:36,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:09:05,120 WARN L293 SmtUtils]: Spent 10.94s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:09:09,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:09:11,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:09:15,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:09:19,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:09:23,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:09:27,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:09:31,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:09:35,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:09:57,138 WARN L293 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:10:01,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:10:05,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:10:09,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:10:12,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:10:21,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:10:24,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:10:35,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:10:38,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:10:42,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:11:01,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:11:05,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:11:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:06,679 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2023-11-29 05:11:06,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-29 05:11:06,679 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 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 34 [2023-11-29 05:11:06,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:06,680 INFO L225 Difference]: With dead ends: 71 [2023-11-29 05:11:06,680 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 05:11:06,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 358.2s TimeCoverageRelationStatistics Valid=774, Invalid=2752, Unknown=34, NotChecked=600, Total=4160 [2023-11-29 05:11:06,683 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 18 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 161.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 161.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:06,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 207 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 405 Invalid, 34 Unknown, 180 Unchecked, 161.8s Time] [2023-11-29 05:11:06,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 05:11:06,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-29 05:11:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 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) [2023-11-29 05:11:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2023-11-29 05:11:06,697 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 34 [2023-11-29 05:11:06,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:06,697 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2023-11-29 05:11:06,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 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) [2023-11-29 05:11:06,698 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2023-11-29 05:11:06,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 05:11:06,700 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:06,700 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1] [2023-11-29 05:11:06,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 05:11:06,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:11:06,901 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:06,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:06,901 INFO L85 PathProgramCache]: Analyzing trace with hash 533650909, now seen corresponding path program 4 times [2023-11-29 05:11:06,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:06,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400561777] [2023-11-29 05:11:06,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:06,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:11:07,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:07,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400561777] [2023-11-29 05:11:07,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400561777] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:11:07,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669693540] [2023-11-29 05:11:07,820 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:11:07,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:11:07,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:11:07,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:11:07,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17da749b-96c1-45d1-b9a2-171a9d2f384f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:11:07,895 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:11:07,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:11:07,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 101 conjunts are in the unsatisfiable core [2023-11-29 05:11:07,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:11:08,727 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:11:08,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:14:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 655 refuted. 17 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:14:22,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669693540] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:14:22,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:14:22,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 70 [2023-11-29 05:14:22,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019350278] [2023-11-29 05:14:22,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:14:22,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-29 05:14:22,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:14:22,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-29 05:14:22,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=816, Invalid=4129, Unknown=25, NotChecked=0, Total=4970 [2023-11-29 05:14:22,779 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 71 states, 71 states have (on average 2.7746478873239435) internal successors, (197), 70 states have internal predecessors, (197), 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) [2023-11-29 05:14:27,697 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse1 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse5 (= 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)) (.cse0 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse6 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse7 (= (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)) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse10 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (not .cse0) (not .cse1) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (not .cse2) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse2) (or .cse3 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse4) (not .cse5) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) .cse1) (or .cse6 (not (= 30 (mod (+ 840 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 21)) 4294967296)))) (not .cse7) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse5) (not .cse4) (or .cse8 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (or .cse0 (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 924 (* |c_ULTIMATE.start_main_~y~0#1| 22)) 4294967296)))) (not .cse6) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse7) (not .cse3) (not .cse9) (or .cse10 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse8) (not .cse10) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse9))) is different from false [2023-11-29 05:14:31,716 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse4 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse3 (= (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_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse6 (= (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)) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not .cse0) (not .cse1) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse1) (or .cse2 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse3) (not .cse4) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) .cse0) (or .cse5 (not (= 30 (mod (+ 840 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 21)) 4294967296)))) (not .cse6) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse4) (not .cse3) (or .cse7 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (not .cse5) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse6) (not .cse2) (not .cse8) (or .cse9 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse7) (not .cse9) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse8))) is different from false [2023-11-29 05:14:35,731 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse2 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse5 (= 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)) (.cse6 (= (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)) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (not .cse0) (not .cse1) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse1) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse2) (or .cse3 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse4) (not .cse5) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) .cse0) (not .cse2) (not .cse6) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse5) (not .cse4) (or .cse7 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse6) (not .cse3) (not .cse8) (or .cse9 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse7) (not .cse9) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse8))) is different from false [2023-11-29 05:14:39,742 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse4 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse5 (= (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)) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not .cse0) (not .cse1) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse1) (or .cse2 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse3) (not .cse4) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) .cse0) (not .cse5) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse4) (not .cse3) (or .cse6 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse5) (not .cse2) (not .cse7) (or .cse8 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse6) (not .cse8) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse7))) is different from false [2023-11-29 05:14:43,760 WARN L854 $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)) (.cse4 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse5 (= (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)) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse1) (or .cse2 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse3) (not .cse4) (not .cse1) (not .cse5) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse4) (not .cse3) (or .cse6 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse5) (not .cse2) (not .cse7) (or .cse8 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse6) (not .cse8) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse7))) is different from false [2023-11-29 05:14:47,784 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse4 (= (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)) (.cse5 (= 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)) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (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))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or .cse1 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse2) (not .cse3) (not .cse4) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse3) (not .cse2) (or .cse5 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse4) (not .cse1) (not .cse6) (or .cse7 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse5) (not .cse7) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse6))) is different from false [2023-11-29 05:14:51,805 WARN L854 $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)) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse4 (= (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)) (.cse5 (= 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)) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse1) (or .cse2 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse3) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not .cse1) (not .cse4) (not .cse3) (or .cse5 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse4) (not .cse2) (not .cse6) (or .cse7 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse5) (not .cse7) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse6))) is different from false [2023-11-29 05:14:55,819 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse3 (= (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)) (.cse4 (= 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)) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (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))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or .cse1 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse2) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not .cse3) (not .cse2) (or .cse4 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse3) (not .cse1) (not .cse5) (or .cse6 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse4) (not .cse6) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse5))) is different from false [2023-11-29 05:14:59,856 WARN L854 $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)) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse4 (= (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)) (.cse5 (= 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| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse1) (or .cse2 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse3) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not .cse1) (not .cse4) (not .cse3) (or .cse5 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse4) (not .cse2) (not .cse6) (not .cse5) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse6))) is different from false [2023-11-29 05:15:03,870 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse3 (= (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)) (.cse4 (= 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| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (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))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or .cse1 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse2) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not .cse3) (not .cse2) (or .cse4 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse3) (not .cse1) (not .cse5) (not .cse4) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse5))) is different from false [2023-11-29 05:15:07,885 WARN L854 $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)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse3 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= 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| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse1) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse2) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not .cse1) (not .cse3) (not .cse2) (or .cse4 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse3) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not .cse5) (not .cse4) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse5))) is different from false [2023-11-29 05:15:11,898 WARN L854 $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 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse2 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse3 (= 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| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (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))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse1) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not .cse2) (not .cse1) (or .cse3 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse2) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not .cse4) (not .cse3) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse4))) is different from false [2023-11-29 05:15:15,917 WARN L854 $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)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse3 (= 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| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse1) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse2) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not .cse1) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not .cse2) (or .cse3 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 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 .cse4) (not .cse3) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse4))) is different from false [2023-11-29 05:15:19,933 WARN L854 $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 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse2 (= 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| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (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))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse1) (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 .cse1) (or .cse2 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 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 .cse3) (not .cse2) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse3))) is different from false [2023-11-29 05:15:23,946 WARN L854 $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)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse1) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse2) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not .cse1) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not .cse2) (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 .cse3) (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)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse3))) is different from false [2023-11-29 05:15:27,958 WARN L854 $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 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (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))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse1) (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 .cse1) (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 .cse2) (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)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse2))) is different from false [2023-11-29 05:15:32,007 WARN L854 $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)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30))) (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse1) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse2) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not .cse1) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not .cse2) (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 [2023-11-29 05:15:36,019 WARN L854 $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 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30))) (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))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse1) (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 .cse1) (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 [2023-11-29 05:15:40,031 WARN L854 $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))) (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse1) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not .cse1) (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 [2023-11-29 05:15:44,049 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296)))) (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))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse0) (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 [2023-11-29 05:15:48,062 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0))) (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))) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not .cse0) (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 [2023-11-29 05:15:52,074 WARN L854 $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))) (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