./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/Mono6_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/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_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/Mono6_1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/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_1ca22a64-c4bc-4e3d-a672-142dc1734b69/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 d34109ac38ddcd69eb693c43509c1355293ac88c80ebd192d8e2af9a8be8f805 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:13:58,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:13:58,965 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:13:58,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:13:58,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:13:58,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:13:58,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:13:58,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:13:58,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:13:58,998 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:13:58,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:13:58,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:13:59,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:13:59,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:13:59,001 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:13:59,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:13:59,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:13:59,003 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:13:59,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:13:59,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:13:59,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:13:59,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:13:59,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:13:59,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:13:59,006 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:13:59,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:13:59,007 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:13:59,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:13:59,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:13:59,009 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:13:59,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:13:59,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:13:59,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:13:59,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:13:59,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:13:59,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:13:59,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:13:59,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:13:59,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:13:59,013 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:13:59,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:13:59,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:13:59,013 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_1ca22a64-c4bc-4e3d-a672-142dc1734b69/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_1ca22a64-c4bc-4e3d-a672-142dc1734b69/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 -> d34109ac38ddcd69eb693c43509c1355293ac88c80ebd192d8e2af9a8be8f805 [2023-11-29 03:13:59,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:13:59,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:13:59,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:13:59,279 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:13:59,279 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:13:59,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/loops-crafted-1/Mono6_1.c [2023-11-29 03:14:02,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:14:02,320 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:14:02,320 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/sv-benchmarks/c/loops-crafted-1/Mono6_1.c [2023-11-29 03:14:02,326 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/data/e3948b313/633813925b1f40aab6507b2fd55ecbb1/FLAG742c4a422 [2023-11-29 03:14:02,342 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/data/e3948b313/633813925b1f40aab6507b2fd55ecbb1 [2023-11-29 03:14:02,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:14:02,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:14:02,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:14:02,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:14:02,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:14:02,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:14:02" (1/1) ... [2023-11-29 03:14:02,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599458e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02, skipping insertion in model container [2023-11-29 03:14:02,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:14:02" (1/1) ... [2023-11-29 03:14:02,381 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:14:02,556 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_1ca22a64-c4bc-4e3d-a672-142dc1734b69/sv-benchmarks/c/loops-crafted-1/Mono6_1.c[311,324] [2023-11-29 03:14:02,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:14:02,582 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:14:02,597 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_1ca22a64-c4bc-4e3d-a672-142dc1734b69/sv-benchmarks/c/loops-crafted-1/Mono6_1.c[311,324] [2023-11-29 03:14:02,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:14:02,618 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:14:02,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02 WrapperNode [2023-11-29 03:14:02,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:14:02,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:14:02,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:14:02,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:14:02,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02" (1/1) ... [2023-11-29 03:14:02,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02" (1/1) ... [2023-11-29 03:14:02,657 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2023-11-29 03:14:02,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:14:02,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:14:02,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:14:02,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:14:02,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02" (1/1) ... [2023-11-29 03:14:02,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02" (1/1) ... [2023-11-29 03:14:02,672 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02" (1/1) ... [2023-11-29 03:14:02,684 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 03:14:02,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02" (1/1) ... [2023-11-29 03:14:02,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02" (1/1) ... [2023-11-29 03:14:02,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02" (1/1) ... [2023-11-29 03:14:02,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02" (1/1) ... [2023-11-29 03:14:02,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02" (1/1) ... [2023-11-29 03:14:02,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02" (1/1) ... [2023-11-29 03:14:02,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:14:02,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:14:02,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:14:02,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:14:02,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02" (1/1) ... [2023-11-29 03:14:02,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:14:02,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:14:02,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:14:02,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:14:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:14:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:14:02,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:14:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:14:02,829 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:14:02,831 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:14:02,927 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:14:02,948 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:14:02,948 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:14:02,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:14:02 BoogieIcfgContainer [2023-11-29 03:14:02,949 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:14:02,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:14:02,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:14:02,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:14:02,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:14:02" (1/3) ... [2023-11-29 03:14:02,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541debac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:14:02, skipping insertion in model container [2023-11-29 03:14:02,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:14:02" (2/3) ... [2023-11-29 03:14:02,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541debac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:14:02, skipping insertion in model container [2023-11-29 03:14:02,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:14:02" (3/3) ... [2023-11-29 03:14:02,957 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono6_1.c [2023-11-29 03:14:02,973 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:14:02,974 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:14:03,040 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:14:03,048 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;@2dcadd00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:14:03,049 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:14:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:14:03,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 03:14:03,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:14:03,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:14:03,062 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:14:03,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:14:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash 63417192, now seen corresponding path program 1 times [2023-11-29 03:14:03,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:14:03,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331448237] [2023-11-29 03:14:03,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:14:03,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:14:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:03,222 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 03:14:03,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:14:03,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331448237] [2023-11-29 03:14:03,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331448237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:14:03,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:14:03,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:14:03,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800091553] [2023-11-29 03:14:03,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:14:03,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:14:03,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:14:03,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:14:03,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:14:03,260 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:14:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:14:03,277 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2023-11-29 03:14:03,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:14:03,280 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 03:14:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:14:03,288 INFO L225 Difference]: With dead ends: 16 [2023-11-29 03:14:03,288 INFO L226 Difference]: Without dead ends: 8 [2023-11-29 03:14:03,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:14:03,294 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:14:03,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:14:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-29 03:14:03,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-29 03:14:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:14:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2023-11-29 03:14:03,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2023-11-29 03:14:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:14:03,320 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-11-29 03:14:03,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:14:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2023-11-29 03:14:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 03:14:03,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:14:03,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:14:03,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:14:03,322 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:14:03,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:14:03,323 INFO L85 PathProgramCache]: Analyzing trace with hash 63089491, now seen corresponding path program 1 times [2023-11-29 03:14:03,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:14:03,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276729233] [2023-11-29 03:14:03,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:14:03,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:14:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:03,521 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 03:14:03,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:14:03,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276729233] [2023-11-29 03:14:03,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276729233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:14:03,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:14:03,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:14:03,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336535719] [2023-11-29 03:14:03,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:14:03,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:14:03,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:14:03,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:14:03,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:14:03,526 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:14:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:14:03,557 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2023-11-29 03:14:03,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:14:03,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 03:14:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:14:03,558 INFO L225 Difference]: With dead ends: 18 [2023-11-29 03:14:03,558 INFO L226 Difference]: Without dead ends: 11 [2023-11-29 03:14:03,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:14:03,561 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:14:03,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:14:03,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-29 03:14:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2023-11-29 03:14:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 03:14:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-29 03:14:03,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 5 [2023-11-29 03:14:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:14:03,568 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-29 03:14:03,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:14:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-11-29 03:14:03,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 03:14:03,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:14:03,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:14:03,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:14:03,570 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:14:03,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:14:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash -100395752, now seen corresponding path program 1 times [2023-11-29 03:14:03,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:14:03,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095256267] [2023-11-29 03:14:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:14:03,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:14:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:14:03,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:14:03,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095256267] [2023-11-29 03:14:03,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095256267] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:14:03,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655941531] [2023-11-29 03:14:03,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:14:03,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:14:03,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:14:03,831 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:14:03,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:14:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:03,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:14:03,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:14:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:14:04,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:14:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:14:04,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655941531] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:14:04,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:14:04,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2023-11-29 03:14:04,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136517640] [2023-11-29 03:14:04,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:14:04,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:14:04,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:14:04,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:14:04,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:14:04,089 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 03:14:04,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:14:04,358 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2023-11-29 03:14:04,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:14:04,360 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 03:14:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:14:04,361 INFO L225 Difference]: With dead ends: 32 [2023-11-29 03:14:04,361 INFO L226 Difference]: Without dead ends: 21 [2023-11-29 03:14:04,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:14:04,364 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:14:04,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:14:04,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-29 03:14:04,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-11-29 03:14:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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 03:14:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-11-29 03:14:04,373 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 8 [2023-11-29 03:14:04,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:14:04,373 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-11-29 03:14:04,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 03:14:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-11-29 03:14:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 03:14:04,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:14:04,375 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2023-11-29 03:14:04,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:14:04,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-29 03:14:04,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:14:04,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:14:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1140498195, now seen corresponding path program 2 times [2023-11-29 03:14:04,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:14:04,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3826138] [2023-11-29 03:14:04,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:14:04,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:14:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:14:04,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:14:04,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3826138] [2023-11-29 03:14:04,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3826138] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:14:04,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599459659] [2023-11-29 03:14:04,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:14:04,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:14:04,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:14:04,893 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:14:04,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:14:04,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 03:14:04,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:14:04,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 03:14:04,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:14:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 03:14:05,082 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:14:05,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599459659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:14:05,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:14:05,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-11-29 03:14:05,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079719381] [2023-11-29 03:14:05,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:14:05,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:14:05,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:14:05,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:14:05,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:14:05,086 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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 03:14:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:14:05,150 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2023-11-29 03:14:05,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:14:05,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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) Word has length 17 [2023-11-29 03:14:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:14:05,153 INFO L225 Difference]: With dead ends: 29 [2023-11-29 03:14:05,154 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 03:14:05,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:14:05,155 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:14:05,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 13 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:14:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 03:14:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-29 03:14:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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 03:14:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-11-29 03:14:05,164 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2023-11-29 03:14:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:14:05,165 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-11-29 03:14:05,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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 03:14:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-11-29 03:14:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 03:14:05,166 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:14:05,166 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2023-11-29 03:14:05,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:14:05,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:14:05,368 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:14:05,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:14:05,369 INFO L85 PathProgramCache]: Analyzing trace with hash 460439825, now seen corresponding path program 1 times [2023-11-29 03:14:05,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:14:05,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100627451] [2023-11-29 03:14:05,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:14:05,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:14:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 03:14:05,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:14:05,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100627451] [2023-11-29 03:14:05,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100627451] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:14:05,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208100302] [2023-11-29 03:14:05,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:14:05,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:14:05,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:14:05,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:14:05,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:14:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:05,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 03:14:05,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:14:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 03:14:05,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:14:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:14:05,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208100302] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:14:05,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:14:05,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 8] total 13 [2023-11-29 03:14:05,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553902953] [2023-11-29 03:14:05,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:14:05,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 03:14:05,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:14:05,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 03:14:05,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:14:05,885 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 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 03:14:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:14:07,661 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2023-11-29 03:14:07,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:14:07,661 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 03:14:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:14:07,662 INFO L225 Difference]: With dead ends: 52 [2023-11-29 03:14:07,662 INFO L226 Difference]: Without dead ends: 42 [2023-11-29 03:14:07,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2023-11-29 03:14:07,664 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 54 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:14:07,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 16 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:14:07,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-29 03:14:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2023-11-29 03:14:07,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 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 03:14:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2023-11-29 03:14:07,676 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 17 [2023-11-29 03:14:07,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:14:07,676 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-11-29 03:14:07,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 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 03:14:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2023-11-29 03:14:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 03:14:07,678 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:14:07,678 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2023-11-29 03:14:07,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 03:14:07,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:14:07,884 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:14:07,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:14:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash 634443802, now seen corresponding path program 2 times [2023-11-29 03:14:07,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:14:07,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274247052] [2023-11-29 03:14:07,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:14:07,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:14:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:14:07,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:14:07,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274247052] [2023-11-29 03:14:07,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274247052] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:14:07,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005599100] [2023-11-29 03:14:07,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:14:07,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:14:07,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:14:07,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:14:07,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:14:08,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:14:08,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:14:08,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 03:14:08,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:14:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:14:08,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:14:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 03:14:08,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005599100] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:14:08,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:14:08,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 20 [2023-11-29 03:14:08,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185801637] [2023-11-29 03:14:08,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:14:08,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 03:14:08,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:14:08,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 03:14:08,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-11-29 03:14:08,423 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:14:12,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:14:15,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:14:15,419 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2023-11-29 03:14:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:14:15,420 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-29 03:14:15,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:14:15,421 INFO L225 Difference]: With dead ends: 108 [2023-11-29 03:14:15,421 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 03:14:15,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2023-11-29 03:14:15,422 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:14:15,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 22 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-11-29 03:14:15,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 03:14:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2023-11-29 03:14:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 77 states have internal predecessors, (94), 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 03:14:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2023-11-29 03:14:15,435 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 20 [2023-11-29 03:14:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:14:15,435 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2023-11-29 03:14:15,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:14:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2023-11-29 03:14:15,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 03:14:15,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:14:15,436 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1] [2023-11-29 03:14:15,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 03:14:15,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:14:15,637 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:14:15,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:14:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash -469730187, now seen corresponding path program 3 times [2023-11-29 03:14:15,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:14:15,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28367502] [2023-11-29 03:14:15,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:14:15,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:14:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 79 proven. 40 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 03:14:15,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:14:15,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28367502] [2023-11-29 03:14:15,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28367502] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:14:15,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888879555] [2023-11-29 03:14:15,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 03:14:15,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:14:15,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:14:15,790 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:14:15,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:14:15,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 03:14:15,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:14:15,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:14:15,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:14:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-29 03:14:15,950 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:14:15,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888879555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:14:15,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:14:15,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-11-29 03:14:15,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029354536] [2023-11-29 03:14:15,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:14:15,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:14:15,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:14:15,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:14:15,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:14:15,952 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 03:14:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:14:16,021 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2023-11-29 03:14:16,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:14:16,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-11-29 03:14:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:14:16,023 INFO L225 Difference]: With dead ends: 102 [2023-11-29 03:14:16,023 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 03:14:16,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:14:16,024 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:14:16,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 7 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:14:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 03:14:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 65. [2023-11-29 03:14:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.1875) internal successors, (76), 64 states have internal predecessors, (76), 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 03:14:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2023-11-29 03:14:16,042 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 35 [2023-11-29 03:14:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:14:16,042 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2023-11-29 03:14:16,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 03:14:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2023-11-29 03:14:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 03:14:16,044 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:14:16,044 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1] [2023-11-29 03:14:16,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 03:14:16,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:14:16,246 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:14:16,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:14:16,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1233146490, now seen corresponding path program 4 times [2023-11-29 03:14:16,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:14:16,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126250180] [2023-11-29 03:14:16,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:14:16,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:14:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 21 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:14:16,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:14:16,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126250180] [2023-11-29 03:14:16,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126250180] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:14:16,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445537804] [2023-11-29 03:14:16,475 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 03:14:16,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:14:16,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:14:16,477 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:14:16,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:14:16,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 03:14:16,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:14:16,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 03:14:16,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:14:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:14:16,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:14:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 03:14:17,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445537804] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:14:17,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:14:17,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 13] total 38 [2023-11-29 03:14:17,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634597961] [2023-11-29 03:14:17,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:14:17,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 03:14:17,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:14:17,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 03:14:17,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1231, Unknown=0, NotChecked=0, Total=1482 [2023-11-29 03:14:17,432 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 39 states, 39 states have (on average 2.8461538461538463) internal successors, (111), 38 states have internal predecessors, (111), 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 03:15:12,863 WARN L293 SmtUtils]: Spent 28.59s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:15:16,870 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 03:15:20,951 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 03:15:25,327 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 03:15:27,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:31,514 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 03:15:35,526 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 03:15:39,531 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 03:15:43,538 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 03:15:47,543 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 03:15:51,547 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 03:15:55,946 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 03:16:00,748 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 03:16:04,988 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 03:16:58,621 WARN L293 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:17:01,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:17:05,214 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 03:17:09,221 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 03:17:13,230 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 03:17:17,241 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 03:17:21,251 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 03:17:25,260 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 03:17:29,273 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 03:17:33,280 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 03:17:37,287 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 03:18:12,229 WARN L293 SmtUtils]: Spent 11.59s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:18:16,619 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 03:18:20,624 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 03:18:23,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:18:27,514 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 03:18:31,524 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 03:18:35,531 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 03:18:39,537 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 03:18:41,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:19:00,226 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 03:19:04,443 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 03:19:07,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:19:11,394 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 03:19:15,398 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 03:19:20,155 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 03:19:33,179 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 03:19:37,185 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 03:19:38,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:19:42,872 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 03:19:46,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:19:54,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:19:58,215 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 03:20:05,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:20:07,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:20:14,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:14,604 INFO L93 Difference]: Finished difference Result 249 states and 304 transitions. [2023-11-29 03:20:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-29 03:20:14,604 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.8461538461538463) internal successors, (111), 38 states have internal predecessors, (111), 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 38 [2023-11-29 03:20:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:14,606 INFO L225 Difference]: With dead ends: 249 [2023-11-29 03:20:14,606 INFO L226 Difference]: Without dead ends: 176 [2023-11-29 03:20:14,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1853 ImplicationChecksByTransitivity, 177.5s TimeCoverageRelationStatistics Valid=1315, Invalid=5822, Unknown=3, NotChecked=0, Total=7140 [2023-11-29 03:20:14,610 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 25 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 179.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 180.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:14,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 245 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1150 Invalid, 36 Unknown, 0 Unchecked, 180.3s Time] [2023-11-29 03:20:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-11-29 03:20:14,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 129. [2023-11-29 03:20:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.2578125) internal successors, (161), 128 states have internal predecessors, (161), 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 03:20:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 161 transitions. [2023-11-29 03:20:14,636 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 161 transitions. Word has length 38 [2023-11-29 03:20:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:14,636 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 161 transitions. [2023-11-29 03:20:14,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.8461538461538463) internal successors, (111), 38 states have internal predecessors, (111), 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 03:20:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 161 transitions. [2023-11-29 03:20:14,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 03:20:14,638 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:14,638 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 2, 1, 1, 1, 1, 1] [2023-11-29 03:20:14,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 03:20:14,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:20:14,839 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:14,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:14,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1157245047, now seen corresponding path program 5 times [2023-11-29 03:20:14,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:20:14,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585669521] [2023-11-29 03:20:14,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:14,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:20:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 93 proven. 187 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:20:15,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:20:15,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585669521] [2023-11-29 03:20:15,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585669521] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:20:15,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018653347] [2023-11-29 03:20:15,121 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 03:20:15,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:20:15,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:20:15,123 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:20:15,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 03:20:16,955 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-11-29 03:20:16,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:20:16,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:20:16,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:20:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2023-11-29 03:20:17,035 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:20:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2023-11-29 03:20:17,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018653347] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:20:17,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:20:17,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2023-11-29 03:20:17,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236012974] [2023-11-29 03:20:17,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:20:17,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 03:20:17,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:20:17,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 03:20:17,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:20:17,131 INFO L87 Difference]: Start difference. First operand 129 states and 161 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:17,454 INFO L93 Difference]: Finished difference Result 176 states and 219 transitions. [2023-11-29 03:20:17,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 03:20:17,455 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-11-29 03:20:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:17,456 INFO L225 Difference]: With dead ends: 176 [2023-11-29 03:20:17,456 INFO L226 Difference]: Without dead ends: 77 [2023-11-29 03:20:17,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2023-11-29 03:20:17,458 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:17,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 24 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:20:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-29 03:20:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2023-11-29 03:20:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 75 states have internal predecessors, (77), 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 03:20:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2023-11-29 03:20:17,477 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 47 [2023-11-29 03:20:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:17,478 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2023-11-29 03:20:17,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2023-11-29 03:20:17,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 03:20:17,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:17,480 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1] [2023-11-29 03:20:17,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 03:20:17,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:20:17,684 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:17,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1674821434, now seen corresponding path program 6 times [2023-11-29 03:20:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:20:17,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382314054] [2023-11-29 03:20:17,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:20:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 45 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:20:18,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:20:18,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382314054] [2023-11-29 03:20:18,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382314054] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:20:18,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814040400] [2023-11-29 03:20:18,370 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 03:20:18,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:20:18,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:20:18,371 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:20:18,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 03:20:18,416 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-29 03:20:18,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:20:18,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 03:20:18,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:20:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2023-11-29 03:20:18,760 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:20:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2023-11-29 03:20:19,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814040400] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:20:19,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:20:19,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 5, 5] total 32 [2023-11-29 03:20:19,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849492961] [2023-11-29 03:20:19,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:20:19,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 03:20:19,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:20:19,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 03:20:19,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 03:20:19,056 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 33 states, 33 states have (on average 2.787878787878788) internal successors, (92), 32 states have internal predecessors, (92), 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 03:20:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:20,499 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2023-11-29 03:20:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-29 03:20:20,499 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.787878787878788) internal successors, (92), 32 states have internal predecessors, (92), 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 74 [2023-11-29 03:20:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:20,500 INFO L225 Difference]: With dead ends: 104 [2023-11-29 03:20:20,500 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 03:20:20,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=457, Invalid=3575, Unknown=0, NotChecked=0, Total=4032 [2023-11-29 03:20:20,503 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 64 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:20,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 58 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1903 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:20:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 03:20:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2023-11-29 03:20:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 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 03:20:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2023-11-29 03:20:20,521 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 74 [2023-11-29 03:20:20,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:20,522 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2023-11-29 03:20:20,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.787878787878788) internal successors, (92), 32 states have internal predecessors, (92), 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 03:20:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2023-11-29 03:20:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 03:20:20,523 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:20,523 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 23, 4, 1, 1, 1, 1, 1] [2023-11-29 03:20:20,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 03:20:20,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 03:20:20,724 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:20,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1638324680, now seen corresponding path program 7 times [2023-11-29 03:20:20,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:20:20,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563577040] [2023-11-29 03:20:20,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:20,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:20:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 260 proven. 805 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 03:20:21,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:20:21,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563577040] [2023-11-29 03:20:21,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563577040] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:20:21,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485210215] [2023-11-29 03:20:21,438 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 03:20:21,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:20:21,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:20:21,440 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:20:21,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ca22a64-c4bc-4e3d-a672-142dc1734b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 03:20:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:21,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-29 03:20:21,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:20:22,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:20:22,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:20:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1054 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 03:20:24,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485210215] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:20:24,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:20:24,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 34, 26] total 83 [2023-11-29 03:20:24,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523654958] [2023-11-29 03:20:24,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:20:24,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2023-11-29 03:20:24,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:20:24,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2023-11-29 03:20:24,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1005, Invalid=5967, Unknown=0, NotChecked=0, Total=6972 [2023-11-29 03:20:24,759 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 84 states, 84 states have (on average 2.8452380952380953) internal successors, (239), 83 states have internal predecessors, (239), 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 03:20:29,805 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:20:33,821 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:20:37,832 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:20:41,889 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:20:45,940 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:20:49,961 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:20:53,976 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:20:57,998 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:21:02,009 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:21:06,057 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:21:10,172 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:24:14,909 WARN L293 SmtUtils]: Spent 1.56m on a formula simplification that was a NOOP. DAG size: 95 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:24:18,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:24:23,319 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:24:27,334 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:24:31,345 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:27:18,287 WARN L293 SmtUtils]: Spent 1.25m on a formula simplification that was a NOOP. DAG size: 85 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:27:23,269 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 03:27:27,284 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-11-29 03:27:31,299 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false