./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87992b509300f030a5da432e9377be19bc7547f7933c7234d13c36c34b6235c7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:25:53,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:25:53,242 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:25:53,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:25:53,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:25:53,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:25:53,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:25:53,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:25:53,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:25:53,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:25:53,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:25:53,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:25:53,302 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:25:53,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:25:53,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:25:53,305 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:25:53,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:25:53,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:25:53,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:25:53,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:25:53,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:25:53,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:25:53,307 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:25:53,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:25:53,308 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:25:53,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:25:53,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:25:53,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:25:53,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:53,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:25:53,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:25:53,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:25:53,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:25:53,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:25:53,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:25:53,313 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:25:53,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:25:53,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:25:53,314 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:25:53,314 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_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/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_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87992b509300f030a5da432e9377be19bc7547f7933c7234d13c36c34b6235c7 [2023-11-06 22:25:53,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:25:53,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:25:53,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:25:53,659 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:25:53,660 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:25:53,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c [2023-11-06 22:25:56,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:25:57,079 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:25:57,079 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c [2023-11-06 22:25:57,086 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/data/980aeb0ac/e961978e2ae7437dbaa5292a0e66764b/FLAG60d2754f4 [2023-11-06 22:25:57,104 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/data/980aeb0ac/e961978e2ae7437dbaa5292a0e66764b [2023-11-06 22:25:57,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:25:57,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:25:57,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:25:57,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:25:57,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:25:57,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:57" (1/1) ... [2023-11-06 22:25:57,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc00591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:57, skipping insertion in model container [2023-11-06 22:25:57,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:57" (1/1) ... [2023-11-06 22:25:57,137 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:25:57,272 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_56a841e3-f61e-4a3a-84b7-e05b6667d95b/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c[313,326] [2023-11-06 22:25:57,284 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:25:57,294 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:25:57,306 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_56a841e3-f61e-4a3a-84b7-e05b6667d95b/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c[313,326] [2023-11-06 22:25:57,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:25:57,324 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:25:57,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:57 WrapperNode [2023-11-06 22:25:57,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:25:57,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:25:57,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:25:57,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:25:57,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:57" (1/1) ... [2023-11-06 22:25:57,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:57" (1/1) ... [2023-11-06 22:25:57,360 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 25 [2023-11-06 22:25:57,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:25:57,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:25:57,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:25:57,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:25:57,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:57" (1/1) ... [2023-11-06 22:25:57,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:57" (1/1) ... [2023-11-06 22:25:57,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:57" (1/1) ... [2023-11-06 22:25:57,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:57" (1/1) ... [2023-11-06 22:25:57,374 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:57" (1/1) ... [2023-11-06 22:25:57,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:57" (1/1) ... [2023-11-06 22:25:57,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:57" (1/1) ... [2023-11-06 22:25:57,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:57" (1/1) ... [2023-11-06 22:25:57,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:25:57,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:25:57,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:25:57,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:25:57,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:57" (1/1) ... [2023-11-06 22:25:57,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:57,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:57,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:25:57,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:25:57,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:25:57,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:25:57,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:25:57,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:25:57,506 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:25:57,508 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:25:57,687 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:25:57,694 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:25:57,694 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:25:57,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:57 BoogieIcfgContainer [2023-11-06 22:25:57,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:25:57,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:25:57,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:25:57,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:25:57,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:25:57" (1/3) ... [2023-11-06 22:25:57,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8ef747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:57, skipping insertion in model container [2023-11-06 22:25:57,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:57" (2/3) ... [2023-11-06 22:25:57,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8ef747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:57, skipping insertion in model container [2023-11-06 22:25:57,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:57" (3/3) ... [2023-11-06 22:25:57,713 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.c [2023-11-06 22:25:57,734 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:25:57,734 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:25:57,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:25:57,816 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@35617d14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:25:57,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:25:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-06 22:25:57,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:25:57,830 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:57,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:25:57,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:57,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash 889937703, now seen corresponding path program 1 times [2023-11-06 22:25:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:57,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534435686] [2023-11-06 22:25:57,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:57,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,034 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-06 22:25:58,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:58,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534435686] [2023-11-06 22:25:58,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534435686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:58,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:58,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:25:58,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421720293] [2023-11-06 22:25:58,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:58,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:25:58,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:58,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:25:58,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:25:58,096 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:58,107 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2023-11-06 22:25:58,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:25:58,109 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 22:25:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:58,117 INFO L225 Difference]: With dead ends: 20 [2023-11-06 22:25:58,117 INFO L226 Difference]: Without dead ends: 8 [2023-11-06 22:25:58,120 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-06 22:25:58,124 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:58,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-06 22:25:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-06 22:25:58,157 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-06 22:25:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2023-11-06 22:25:58,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2023-11-06 22:25:58,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:58,160 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-11-06 22:25:58,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:58,160 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2023-11-06 22:25:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:25:58,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:58,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:25:58,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:25:58,162 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:58,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash 889639793, now seen corresponding path program 1 times [2023-11-06 22:25:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:58,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867462424] [2023-11-06 22:25:58,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:58,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,382 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-06 22:25:58,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:58,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867462424] [2023-11-06 22:25:58,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867462424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:58,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:58,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:25:58,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004304393] [2023-11-06 22:25:58,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:58,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:58,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:58,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:58,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:25:58,391 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:58,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:58,432 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2023-11-06 22:25:58,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:58,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 22:25:58,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:58,436 INFO L225 Difference]: With dead ends: 16 [2023-11-06 22:25:58,436 INFO L226 Difference]: Without dead ends: 10 [2023-11-06 22:25:58,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:25:58,440 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:58,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-06 22:25:58,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-06 22:25:58,452 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-06 22:25:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-06 22:25:58,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2023-11-06 22:25:58,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:58,455 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-06 22:25:58,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:58,456 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-11-06 22:25:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:25:58,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:58,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:58,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:25:58,458 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:58,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:58,464 INFO L85 PathProgramCache]: Analyzing trace with hash 295691924, now seen corresponding path program 1 times [2023-11-06 22:25:58,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:58,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057244316] [2023-11-06 22:25:58,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:58,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,635 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-06 22:25:58,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:58,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057244316] [2023-11-06 22:25:58,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057244316] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:58,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124542897] [2023-11-06 22:25:58,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:58,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:58,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:58,641 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:58,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:25:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:25:58,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:58,829 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-06 22:25:58,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:25:58,881 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-06 22:25:58,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124542897] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:25:58,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:25:58,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-06 22:25:58,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551996991] [2023-11-06 22:25:58,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:25:58,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:25:58,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:58,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:25:58,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:25:58,884 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-06 22:25:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:58,950 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2023-11-06 22:25:58,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:25:58,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-06 22:25:58,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:58,956 INFO L225 Difference]: With dead ends: 20 [2023-11-06 22:25:58,957 INFO L226 Difference]: Without dead ends: 14 [2023-11-06 22:25:58,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:25:58,961 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:58,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:58,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-06 22:25:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2023-11-06 22:25:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-06 22:25:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-11-06 22:25:58,973 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2023-11-06 22:25:58,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:58,974 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-11-06 22:25:58,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-06 22:25:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-11-06 22:25:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:25:58,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:58,975 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:58,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:25:59,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-06 22:25:59,181 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:59,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash 572634524, now seen corresponding path program 1 times [2023-11-06 22:25:59,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:59,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141856348] [2023-11-06 22:25:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:59,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:59,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:59,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141856348] [2023-11-06 22:25:59,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141856348] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:59,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993008613] [2023-11-06 22:25:59,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:59,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:59,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:59,372 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:59,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:25:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:59,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:25:59,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:59,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:25:59,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:59,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993008613] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:25:59,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:25:59,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2023-11-06 22:25:59,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809206798] [2023-11-06 22:25:59,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:25:59,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:25:59,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:59,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:25:59,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:25:59,621 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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-06 22:25:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:59,941 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-11-06 22:25:59,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:25:59,942 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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 12 [2023-11-06 22:25:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:59,943 INFO L225 Difference]: With dead ends: 28 [2023-11-06 22:25:59,943 INFO L226 Difference]: Without dead ends: 21 [2023-11-06 22:25:59,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:25:59,945 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:59,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 17 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:25:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-06 22:25:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-06 22:25:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 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-06 22:25:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-11-06 22:25:59,953 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2023-11-06 22:25:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:59,954 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-11-06 22:25:59,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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-06 22:25:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-11-06 22:25:59,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-06 22:25:59,955 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:59,955 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:59,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 22:26:00,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:00,161 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:00,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:00,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1634475176, now seen corresponding path program 2 times [2023-11-06 22:26:00,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:00,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478345157] [2023-11-06 22:26:00,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:00,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:00,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:00,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478345157] [2023-11-06 22:26:00,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478345157] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:00,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215010496] [2023-11-06 22:26:00,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:26:00,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:00,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:00,355 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:00,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:26:00,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:26:00,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:26:00,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:26:00,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:00,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:26:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:00,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215010496] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:26:00,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:26:00,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2023-11-06 22:26:00,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49879636] [2023-11-06 22:26:00,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:26:00,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 22:26:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:00,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 22:26:00,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:26:00,947 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 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-06 22:26:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:07,085 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2023-11-06 22:26:07,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:26:07,086 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 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-06 22:26:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:07,087 INFO L225 Difference]: With dead ends: 44 [2023-11-06 22:26:07,087 INFO L226 Difference]: Without dead ends: 37 [2023-11-06 22:26:07,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=231, Invalid=369, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:26:07,089 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:07,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 19 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:26:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-06 22:26:07,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-06 22:26:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 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-06 22:26:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2023-11-06 22:26:07,099 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 20 [2023-11-06 22:26:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:07,099 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2023-11-06 22:26:07,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 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-06 22:26:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2023-11-06 22:26:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 22:26:07,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:07,101 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:07,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:07,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:07,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:07,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1104705856, now seen corresponding path program 3 times [2023-11-06 22:26:07,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:07,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885968182] [2023-11-06 22:26:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:07,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:07,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:07,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885968182] [2023-11-06 22:26:07,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885968182] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:07,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15534948] [2023-11-06 22:26:07,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:26:07,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:07,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:07,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:07,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:26:07,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-06 22:26:07,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:26:07,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:26:07,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2023-11-06 22:26:07,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:26:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2023-11-06 22:26:08,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15534948] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:26:08,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:26:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 4, 6] total 23 [2023-11-06 22:26:08,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569925924] [2023-11-06 22:26:08,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:26:08,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 22:26:08,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:08,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 22:26:08,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:26:08,107 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 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-06 22:26:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:08,578 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2023-11-06 22:26:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:26:08,579 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-06 22:26:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:08,580 INFO L225 Difference]: With dead ends: 56 [2023-11-06 22:26:08,580 INFO L226 Difference]: Without dead ends: 47 [2023-11-06 22:26:08,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2023-11-06 22:26:08,582 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:08,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:26:08,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-06 22:26:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-11-06 22:26:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 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-06 22:26:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2023-11-06 22:26:08,609 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 36 [2023-11-06 22:26:08,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:08,610 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2023-11-06 22:26:08,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 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-06 22:26:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2023-11-06 22:26:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 22:26:08,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:08,612 INFO L195 NwaCegarLoop]: trace histogram [19, 15, 4, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:08,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:08,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:08,818 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:08,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:08,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1664138286, now seen corresponding path program 4 times [2023-11-06 22:26:08,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:08,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973676117] [2023-11-06 22:26:08,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:08,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 112 proven. 240 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:26:09,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:09,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973676117] [2023-11-06 22:26:09,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973676117] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:09,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707124515] [2023-11-06 22:26:09,251 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:26:09,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:09,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:09,253 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:09,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:26:09,344 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:26:09,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:26:09,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-06 22:26:09,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:09,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:26:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:10,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707124515] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:26:10,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:26:10,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 43 [2023-11-06 22:26:10,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16971420] [2023-11-06 22:26:10,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:26:10,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-06 22:26:10,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:10,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-06 22:26:10,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1287, Unknown=0, NotChecked=0, Total=1806 [2023-11-06 22:26:10,610 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 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-06 22:26:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:47,499 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2023-11-06 22:26:47,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-06 22:26:47,501 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 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 44 [2023-11-06 22:26:47,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:47,503 INFO L225 Difference]: With dead ends: 76 [2023-11-06 22:26:47,503 INFO L226 Difference]: Without dead ends: 63 [2023-11-06 22:26:47,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=939, Invalid=1922, Unknown=1, NotChecked=0, Total=2862 [2023-11-06 22:26:47,506 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:47,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 66 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-06 22:26:47,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-06 22:26:47,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-06 22:26:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 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-06 22:26:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2023-11-06 22:26:47,520 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 44 [2023-11-06 22:26:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:47,521 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2023-11-06 22:26:47,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 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-06 22:26:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2023-11-06 22:26:47,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-06 22:26:47,523 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:47,523 INFO L195 NwaCegarLoop]: trace histogram [28, 16, 12, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:47,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-06 22:26:47,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:47,731 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:47,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:47,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1269144285, now seen corresponding path program 5 times [2023-11-06 22:26:47,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:47,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400285629] [2023-11-06 22:26:47,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:47,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 391 proven. 272 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-11-06 22:26:48,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:48,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400285629] [2023-11-06 22:26:48,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400285629] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:48,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594981062] [2023-11-06 22:26:48,345 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:26:48,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:48,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:48,346 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:48,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:26:49,070 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2023-11-06 22:26:49,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:26:49,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-06 22:26:49,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 391 proven. 272 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-11-06 22:26:49,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:26:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 380 proven. 304 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-06 22:26:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594981062] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:26:52,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:26:52,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 21] total 39 [2023-11-06 22:26:52,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561678340] [2023-11-06 22:26:52,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:26:52,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-06 22:26:52,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:52,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-06 22:26:52,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1045, Unknown=0, NotChecked=0, Total=1482 [2023-11-06 22:26:52,595 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 states have internal predecessors, (82), 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-06 22:28:37,467 WARN L293 SmtUtils]: Spent 44.07s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:28:39,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:28:43,457 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296)) (.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296)) (.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296)) (.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296)) (.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296)) (.cse7 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296)) (.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296)) (.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296)) (.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296)) (.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296)) (.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296)) (.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296)) (.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (and (or (< .cse0 10000000) (< 9999999 .cse1)) (or (< 99999999 .cse2) (< .cse2 10000000)) (or (< 9999999 .cse0) (< .cse3 10000000)) (or (< .cse4 10000000) (< 9999999 .cse5)) (or (< 9999999 .cse3) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 10000000)) (or (< 9999999 .cse6) (< .cse1 10000000)) (or (< 9999999 .cse7) (< .cse8 10000000)) (or (< 9999999 .cse9) (< .cse6 10000000)) (or (< 9999999 .cse8) (< .cse10 10000000)) (or (< 9999999 .cse11) (< .cse9 10000000)) (or (< .cse7 10000000) (< 9999999 .cse12)) (or (< 9999999 .cse10) (< .cse11 10000000)) (or (< 9999999 .cse2) (< .cse13 10000000)) (or (< .cse5 10000000) (< 9999999 .cse13)) (or (< 9999999 .cse14) (< .cse12 10000000)) (or (< 9999999 .cse4) (< .cse15 10000000)) (or (< .cse14 10000000) (< 9999999 .cse15)))) is different from false [2023-11-06 22:28:43,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:43,462 INFO L93 Difference]: Finished difference Result 128 states and 170 transitions. [2023-11-06 22:28:43,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-06 22:28:43,462 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 states have internal predecessors, (82), 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 62 [2023-11-06 22:28:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:43,464 INFO L225 Difference]: With dead ends: 128 [2023-11-06 22:28:43,464 INFO L226 Difference]: Without dead ends: 99 [2023-11-06 22:28:43,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 109.3s TimeCoverageRelationStatistics Valid=1094, Invalid=1983, Unknown=7, NotChecked=108, Total=3192 [2023-11-06 22:28:43,466 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:43,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 59 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 651 Invalid, 0 Unknown, 38 Unchecked, 4.8s Time] [2023-11-06 22:28:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-06 22:28:43,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-06 22:28:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.1326530612244898) internal successors, (111), 98 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-06 22:28:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2023-11-06 22:28:43,497 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 62 [2023-11-06 22:28:43,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:43,497 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2023-11-06 22:28:43,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 states have internal predecessors, (82), 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-06 22:28:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2023-11-06 22:28:43,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 22:28:43,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:43,502 INFO L195 NwaCegarLoop]: trace histogram [46, 34, 12, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:43,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:43,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:28:43,709 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:43,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:43,710 INFO L85 PathProgramCache]: Analyzing trace with hash -905639277, now seen corresponding path program 6 times [2023-11-06 22:28:43,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:43,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875075085] [2023-11-06 22:28:43,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:43,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 805 proven. 1190 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-11-06 22:28:45,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:45,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875075085] [2023-11-06 22:28:45,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875075085] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:28:45,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793065356] [2023-11-06 22:28:45,311 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:28:45,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:28:45,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:28:45,313 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:28:45,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56a841e3-f61e-4a3a-84b7-e05b6667d95b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:29:11,004 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 47 check-sat command(s) [2023-11-06 22:29:11,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:29:11,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 76 conjunts are in the unsatisfiable core [2023-11-06 22:29:11,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:29:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-06 22:29:11,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:29:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-06 22:29:16,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793065356] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:29:16,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:29:16,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39, 40] total 78 [2023-11-06 22:29:16,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837881797] [2023-11-06 22:29:16,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:29:16,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2023-11-06 22:29:16,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:16,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2023-11-06 22:29:16,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1633, Invalid=4373, Unknown=0, NotChecked=0, Total=6006 [2023-11-06 22:29:16,030 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 78 states, 78 states have (on average 2.051282051282051) internal successors, (160), 78 states have internal predecessors, (160), 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-06 22:29:19,338 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse0 10000000) (< 99999999 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse1 10000000) (< 99999999 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (< .cse2 10000000) (< 99999999 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse3 10000000) (< 99999999 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse4 10000000) (< 99999999 .cse4))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse5 10000000) (< 99999999 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse6 10000000) (< 99999999 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 99999999 .cse7) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< 99999999 .cse8) (< .cse8 10000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 99999999 .cse9) (< .cse9 10000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< 99999999 .cse10) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse11 10000000) (< 99999999 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 99999999 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 99999999 .cse13) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< 99999999 .cse14) (< .cse14 10000000))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< 99999999 .cse15) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< 99999999 .cse16) (< .cse16 10000000))) (let ((.cse17 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse17 10000000) (< 99999999 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 99999999 .cse18) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< .cse19 10000000) (< 99999999 .cse19))) (let ((.cse20 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 99999999 .cse20) (< .cse20 10000000))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (< 99999999 .cse21) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 99999999 .cse22) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< 99999999 .cse23) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse24 10000000) (< 99999999 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse25 10000000) (< 99999999 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< 99999999 .cse26) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse27 10000000) (< 99999999 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 99999999 .cse28) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse29 10000000) (< 99999999 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< 99999999 .cse30) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse31 10000000) (< 99999999 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse32 10000000) (< 99999999 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse33 10000000) (< 99999999 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< 99999999 .cse34) (< .cse34 10000000))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (< 99999999 .cse35) (< .cse35 10000000)))) is different from false [2023-11-06 22:29:21,361 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse0 10000000) (< 99999999 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse1 10000000) (< 99999999 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (< .cse2 10000000) (< 99999999 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse3 10000000) (< 99999999 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse4 10000000) (< 99999999 .cse4))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse5 10000000) (< 99999999 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse6 10000000) (< 99999999 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 99999999 .cse7) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< 99999999 .cse8) (< .cse8 10000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 99999999 .cse9) (< .cse9 10000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< 99999999 .cse10) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse11 10000000) (< 99999999 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 99999999 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 99999999 .cse13) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< 99999999 .cse14) (< .cse14 10000000))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< 99999999 .cse15) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< 99999999 .cse16) (< .cse16 10000000))) (let ((.cse17 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse17 10000000) (< 99999999 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 99999999 .cse18) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< .cse19 10000000) (< 99999999 .cse19))) (let ((.cse20 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 99999999 .cse20) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (< 99999999 .cse21) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 99999999 .cse22) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< 99999999 .cse23) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse24 10000000) (< 99999999 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse25 10000000) (< 99999999 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< 99999999 .cse26) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse27 10000000) (< 99999999 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 99999999 .cse28) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse29 10000000) (< 99999999 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< 99999999 .cse30) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse31 10000000) (< 99999999 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse32 10000000) (< 99999999 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< 99999999 .cse33) (< .cse33 10000000)))) is different from false [2023-11-06 22:29:23,381 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse0 10000000) (< 99999999 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse1 10000000) (< 99999999 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (< .cse2 10000000) (< 99999999 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse3 10000000) (< 99999999 .cse3))) (let ((.cse4 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse4 10000000) (< 99999999 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse5 10000000) (< 99999999 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 99999999 .cse6) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< 99999999 .cse7) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 99999999 .cse8) (< .cse8 10000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< 99999999 .cse9) (< .cse9 10000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse10 10000000) (< 99999999 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 99999999 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 99999999 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< 99999999 .cse13) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< 99999999 .cse14) (< .cse14 10000000))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< 99999999 .cse15) (< .cse15 10000000))) (let ((.cse16 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse16 10000000) (< 99999999 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 99999999 .cse17) (< .cse17 10000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< .cse18 10000000) (< 99999999 .cse18))) (let ((.cse19 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 99999999 .cse19) (< .cse19 10000000))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (< 99999999 .cse20) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 99999999 .cse21) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< 99999999 .cse22) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse23 10000000) (< 99999999 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse24 10000000) (< 99999999 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< 99999999 .cse25) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse26 10000000) (< 99999999 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 99999999 .cse27) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse28 10000000) (< 99999999 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< 99999999 .cse29) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse30 10000000) (< 99999999 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse31 10000000) (< 99999999 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< 99999999 .cse32) (< .cse32 10000000)))) is different from false [2023-11-06 22:29:25,960 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse0 10000000) (< 99999999 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse1 10000000) (< 99999999 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (< .cse2 10000000) (< 99999999 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse3 10000000) (< 99999999 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse4 10000000) (< 99999999 .cse4))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse5 10000000) (< 99999999 .cse5))) (let ((.cse6 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (or (< 99999999 .cse6) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse7 10000000) (< 99999999 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 99999999 .cse8) (< .cse8 10000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< 99999999 .cse9) (< .cse9 10000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 99999999 .cse10) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< 99999999 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse12 10000000) (< 99999999 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 99999999 .cse13) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 99999999 .cse14) (< .cse14 10000000))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< 99999999 .cse15) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< 99999999 .cse16) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< 99999999 .cse17) (< .cse17 10000000))) (let ((.cse18 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse18 10000000) (< 99999999 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 99999999 .cse19) (< .cse19 10000000))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< .cse20 10000000) (< 99999999 .cse20))) (let ((.cse21 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 99999999 .cse21) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (< 99999999 .cse22) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 99999999 .cse23) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< 99999999 .cse24) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse25 10000000) (< 99999999 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse26 10000000) (< 99999999 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< 99999999 .cse27) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse28 10000000) (< 99999999 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 99999999 .cse29) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse30 10000000) (< 99999999 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< 99999999 .cse31) (< .cse31 10000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse32 10000000) (< 99999999 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse33 10000000) (< 99999999 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse34 10000000) (< 99999999 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< 99999999 .cse35) (< .cse35 10000000))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (< 99999999 .cse36) (< .cse36 10000000)))) is different from false [2023-11-06 22:29:28,060 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse0 10000000) (< 99999999 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse1 10000000) (< 99999999 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (< .cse2 10000000) (< 99999999 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse3 10000000) (< 99999999 .cse3))) (let ((.cse4 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse4 10000000) (< 99999999 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse5 10000000) (< 99999999 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 99999999 .cse6) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 99999999 .cse7) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< 99999999 .cse8) (< .cse8 10000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse9 10000000) (< 99999999 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 99999999 .cse10) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 99999999 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< 99999999 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< 99999999 .cse13) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< 99999999 .cse14) (< .cse14 10000000))) (let ((.cse15 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse15 10000000) (< 99999999 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 99999999 .cse16) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< .cse17 10000000) (< 99999999 .cse17))) (let ((.cse18 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 99999999 .cse18) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (< 99999999 .cse19) (< .cse19 10000000))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 99999999 .cse20) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< 99999999 .cse21) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse22 10000000) (< 99999999 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse23 10000000) (< 99999999 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< 99999999 .cse24) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse25 10000000) (< 99999999 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 99999999 .cse26) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse27 10000000) (< 99999999 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< 99999999 .cse28) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse29 10000000) (< 99999999 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse30 10000000) (< 99999999 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< 99999999 .cse31) (< .cse31 10000000)))) is different from false [2023-11-06 22:29:30,166 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse0 10000000) (< 99999999 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (< .cse1 10000000) (< 99999999 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse2 10000000) (< 99999999 .cse2))) (let ((.cse3 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse3 10000000) (< 99999999 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse4 10000000) (< 99999999 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 99999999 .cse5) (< .cse5 10000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 99999999 .cse6) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< 99999999 .cse7) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse8 10000000) (< 99999999 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 99999999 .cse9) (< .cse9 10000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 99999999 .cse10) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< 99999999 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< 99999999 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< 99999999 .cse13) (< .cse13 10000000))) (let ((.cse14 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse14 10000000) (< 99999999 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 99999999 .cse15) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< .cse16 10000000) (< 99999999 .cse16))) (let ((.cse17 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 99999999 .cse17) (< .cse17 10000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (< 99999999 .cse18) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 99999999 .cse19) (< .cse19 10000000))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< 99999999 .cse20) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse21 10000000) (< 99999999 .cse21))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse22 10000000) (< 99999999 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< 99999999 .cse23) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse24 10000000) (< 99999999 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 99999999 .cse25) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse26 10000000) (< 99999999 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< 99999999 .cse27) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse28 10000000) (< 99999999 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse29 10000000) (< 99999999 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< 99999999 .cse30) (< .cse30 10000000)))) is different from false