./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:26:48,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:26:48,468 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:26:48,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:26:48,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:26:48,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:26:48,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:26:48,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:26:48,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:26:48,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:26:48,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:26:48,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:26:48,528 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:26:48,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:26:48,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:26:48,531 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:26:48,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:26:48,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:26:48,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:26:48,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:26:48,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:26:48,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:26:48,534 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:26:48,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:26:48,535 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:26:48,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:26:48,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:26:48,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:26:48,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:26:48,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:26:48,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:26:48,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:26:48,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:26:48,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:26:48,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:26:48,541 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:26:48,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:26:48,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:26:48,542 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:26:48,543 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_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/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_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2023-11-12 02:26:48,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:26:48,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:26:48,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:26:48,936 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:26:48,936 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:26:48,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-11-12 02:26:52,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:26:52,371 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:26:52,372 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-11-12 02:26:52,386 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/data/f81015f85/595909a94edf4516a837b963d00db7d7/FLAG90944bee1 [2023-11-12 02:26:52,400 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/data/f81015f85/595909a94edf4516a837b963d00db7d7 [2023-11-12 02:26:52,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:26:52,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:26:52,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:26:52,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:26:52,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:26:52,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:26:52" (1/1) ... [2023-11-12 02:26:52,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fea752c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:52, skipping insertion in model container [2023-11-12 02:26:52,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:26:52" (1/1) ... [2023-11-12 02:26:52,456 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:26:52,796 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_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-11-12 02:26:52,801 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:26:52,816 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:26:52,890 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_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-11-12 02:26:52,891 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:26:52,922 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:26:52,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:52 WrapperNode [2023-11-12 02:26:52,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:26:52,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:26:52,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:26:52,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:26:52,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:52" (1/1) ... [2023-11-12 02:26:52,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:52" (1/1) ... [2023-11-12 02:26:52,969 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2023-11-12 02:26:52,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:26:52,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:26:52,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:26:52,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:26:52,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:52" (1/1) ... [2023-11-12 02:26:52,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:52" (1/1) ... [2023-11-12 02:26:52,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:52" (1/1) ... [2023-11-12 02:26:52,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:52" (1/1) ... [2023-11-12 02:26:52,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:52" (1/1) ... [2023-11-12 02:26:52,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:52" (1/1) ... [2023-11-12 02:26:52,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:52" (1/1) ... [2023-11-12 02:26:52,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:52" (1/1) ... [2023-11-12 02:26:53,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:26:53,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:26:53,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:26:53,004 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:26:53,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:52" (1/1) ... [2023-11-12 02:26:53,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:26:53,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:26:53,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:26:53,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:26:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-12 02:26:53,085 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-12 02:26:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:26:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:26:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:26:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:26:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:26:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:26:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:26:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:26:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:26:53,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:26:53,220 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:26:53,224 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:26:53,277 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-12 02:26:53,526 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:26:53,533 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:26:53,534 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-12 02:26:53,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:26:53 BoogieIcfgContainer [2023-11-12 02:26:53,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:26:53,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:26:53,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:26:53,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:26:53,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:26:52" (1/3) ... [2023-11-12 02:26:53,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c35ad06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:26:53, skipping insertion in model container [2023-11-12 02:26:53,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:52" (2/3) ... [2023-11-12 02:26:53,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c35ad06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:26:53, skipping insertion in model container [2023-11-12 02:26:53,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:26:53" (3/3) ... [2023-11-12 02:26:53,548 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-11-12 02:26:53,582 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:26:53,583 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:26:53,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:26:53,650 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3ab81b21, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:26:53,651 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:26:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 24 states have (on average 1.5) internal successors, (36), 26 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 02:26:53,663 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:26:53,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:53,664 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:26:53,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:53,672 INFO L85 PathProgramCache]: Analyzing trace with hash 70364755, now seen corresponding path program 1 times [2023-11-12 02:26:53,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:53,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699235496] [2023-11-12 02:26:53,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:53,938 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-12 02:26:53,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:53,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699235496] [2023-11-12 02:26:53,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699235496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:53,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:53,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:26:53,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608451751] [2023-11-12 02:26:53,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:53,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:26:53,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:53,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:26:53,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:26:53,981 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.5) internal successors, (36), 26 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:26:53,998 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2023-11-12 02:26:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:26:54,000 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-12 02:26:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:26:54,005 INFO L225 Difference]: With dead ends: 45 [2023-11-12 02:26:54,006 INFO L226 Difference]: Without dead ends: 20 [2023-11-12 02:26:54,008 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-12 02:26:54,012 INFO L413 NwaCegarLoop]: 34 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, 34 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-12 02:26:54,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:26:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-12 02:26:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-12 02:26:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-12 02:26:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-12 02:26:54,048 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2023-11-12 02:26:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:26:54,049 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-12 02:26:54,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-12 02:26:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 02:26:54,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:26:54,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:54,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:26:54,051 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:26:54,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:54,052 INFO L85 PathProgramCache]: Analyzing trace with hash -273185057, now seen corresponding path program 1 times [2023-11-12 02:26:54,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:54,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851201317] [2023-11-12 02:26:54,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:54,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:54,221 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-12 02:26:54,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:54,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851201317] [2023-11-12 02:26:54,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851201317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:54,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:54,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:26:54,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572594394] [2023-11-12 02:26:54,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:54,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:26:54,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:54,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:26:54,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:26:54,226 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:26:54,250 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-11-12 02:26:54,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:26:54,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-12 02:26:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:26:54,252 INFO L225 Difference]: With dead ends: 36 [2023-11-12 02:26:54,252 INFO L226 Difference]: Without dead ends: 23 [2023-11-12 02:26:54,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:26:54,254 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:26:54,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:26:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-12 02:26:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-11-12 02:26:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-12 02:26:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-12 02:26:54,261 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2023-11-12 02:26:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:26:54,263 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-12 02:26:54,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-12 02:26:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 02:26:54,264 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:26:54,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:54,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:26:54,265 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:26:54,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:54,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2002783247, now seen corresponding path program 1 times [2023-11-12 02:26:54,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:54,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186878853] [2023-11-12 02:26:54,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:54,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:54,454 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-12 02:26:54,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:54,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186878853] [2023-11-12 02:26:54,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186878853] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:26:54,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259609409] [2023-11-12 02:26:54,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:54,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:26:54,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:26:54,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:26:54,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:26:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:54,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:26:54,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:26:54,687 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-12 02:26:54,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:26:54,731 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-12 02:26:54,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259609409] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:26:54,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:26:54,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-12 02:26:54,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770352453] [2023-11-12 02:26:54,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:26:54,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:26:54,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:54,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:26:54,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:26:54,746 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-12 02:26:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:26:54,797 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2023-11-12 02:26:54,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:26:54,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 13 [2023-11-12 02:26:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:26:54,799 INFO L225 Difference]: With dead ends: 43 [2023-11-12 02:26:54,799 INFO L226 Difference]: Without dead ends: 30 [2023-11-12 02:26:54,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:26:54,801 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:26:54,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 73 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:26:54,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-12 02:26:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-12 02:26:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-12 02:26:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-12 02:26:54,809 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 13 [2023-11-12 02:26:54,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:26:54,809 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-12 02:26:54,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-12 02:26:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-12 02:26:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-12 02:26:54,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:26:54,811 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:54,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:26:55,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:26:55,018 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:26:55,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:55,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1740729055, now seen corresponding path program 2 times [2023-11-12 02:26:55,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:55,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172661476] [2023-11-12 02:26:55,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:55,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 02:26:56,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:56,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172661476] [2023-11-12 02:26:56,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172661476] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:26:56,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068874876] [2023-11-12 02:26:56,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:26:56,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:26:56,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:26:56,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:26:56,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:26:56,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 02:26:56,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:26:56,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-12 02:26:56,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:26:56,632 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 02:26:56,697 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 02:26:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:26:56,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:26:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:26:57,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068874876] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:26:57,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:26:57,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2023-11-12 02:26:57,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350707974] [2023-11-12 02:26:57,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:26:57,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-12 02:26:57,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:57,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-12 02:26:57,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-11-12 02:26:57,073 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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-12 02:26:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:26:57,487 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-11-12 02:26:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:26:57,488 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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 22 [2023-11-12 02:26:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:26:57,489 INFO L225 Difference]: With dead ends: 34 [2023-11-12 02:26:57,489 INFO L226 Difference]: Without dead ends: 32 [2023-11-12 02:26:57,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2023-11-12 02:26:57,491 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:26:57,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 145 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:26:57,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-12 02:26:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-12 02:26:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-11-12 02:26:57,500 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2023-11-12 02:26:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:26:57,501 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-12 02:26:57,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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-12 02:26:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-11-12 02:26:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 02:26:57,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:26:57,503 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:57,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:26:57,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:26:57,717 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:26:57,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:57,717 INFO L85 PathProgramCache]: Analyzing trace with hash 625081173, now seen corresponding path program 1 times [2023-11-12 02:26:57,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:57,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586010479] [2023-11-12 02:26:57,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:57,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 02:26:59,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:59,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586010479] [2023-11-12 02:26:59,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586010479] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:26:59,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624573878] [2023-11-12 02:26:59,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:59,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:26:59,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:26:59,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:26:59,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 02:26:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:59,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-12 02:26:59,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:26:59,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 02:26:59,890 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 02:26:59,891 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-12 02:26:59,963 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 02:26:59,964 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-12 02:27:00,018 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 02:27:00,019 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-12 02:27:00,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 02:27:00,180 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-11-12 02:27:00,199 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-12 02:27:00,200 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-12 02:27:00,218 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-12 02:27:00,338 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 02:27:00,338 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2023-11-12 02:27:00,346 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-12 02:27:00,364 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 02:27:00,365 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-12 02:27:00,840 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:27:00,841 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 57 [2023-11-12 02:27:00,858 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:27:00,858 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 54 [2023-11-12 02:27:00,904 INFO L322 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-11-12 02:27:00,905 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 65 [2023-11-12 02:27:00,921 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:27:00,922 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 52 [2023-11-12 02:27:00,946 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:27:00,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2023-11-12 02:27:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 02:27:01,210 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:27:01,555 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:27:01,556 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 286 treesize of output 286 [2023-11-12 02:27:02,790 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse5 (forall ((v_ArrVal_392 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse23 .cse0)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_392 .cse0)) (= (select .cse23 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse6 (forall ((v_ArrVal_392 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_392 .cse0)) (= (select v_ArrVal_392 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse8 (forall ((v_ArrVal_392 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse22 .cse0)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_392 .cse0)) (= (select v_ArrVal_392 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse22 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse10 (forall ((v_ArrVal_392 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_392 .cse0))))) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (not .cse3)) (.cse17 (and .cse5 .cse6 .cse8 .cse10))) (and (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_10) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_prenex_9 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) (or (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_16) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_15) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse3) (or .cse4 .cse3 (and (forall ((v_prenex_5 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse5 .cse6 (forall ((v_prenex_11 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_11 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse0)) (= (select .cse7 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse8 (forall ((v_prenex_11 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse0)) (= (select .cse9 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_11 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse10)) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_9 .cse0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_10) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_9 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_11 (Array Int Int))) (or (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_prenex_12 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_11 (Array Int Int))) (or (forall ((v_prenex_12 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse3) (or (forall ((v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_prenex_11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse3) (or .cse4 (and (or (forall ((v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse3) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_10) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_prenex_9 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_16) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_15) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse12 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 .cse1))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_8) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_7) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (or (and (forall ((v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_prenex_12 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_12 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse13 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse13 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse3) (or (forall ((v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse14 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse14 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse3) (forall ((v_prenex_11 (Array Int Int))) (or (forall ((v_prenex_12 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse15 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse15 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_6) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_14 (Array Int Int)) (v_prenex_13 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_14) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_13) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse3) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_9 .cse0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_10) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse3) (or (forall ((v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse16 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse16 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_prenex_11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse2) (or (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_16) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_15) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse3) (or .cse17 .cse3) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_9 .cse0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_10) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_9 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_8) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_7) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (forall ((v_prenex_11 (Array Int Int))) (or (forall ((v_prenex_12 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse18 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse18 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (or .cse2 (forall ((v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse19 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse19 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_prenex_11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_6) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_14 (Array Int Int)) (v_prenex_13 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_14) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_13) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse3) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_16) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_15) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse20 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse20 .cse1))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) .cse17 .cse3) (or (forall ((v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse21 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_prenex_11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse3) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_9 .cse0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_10) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse3))))) is different from false [2023-11-12 02:27:04,812 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse8 (forall ((v_ArrVal_392 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse22 .cse0)) (= (select .cse22 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_392 .cse0)))))) (.cse10 (forall ((v_ArrVal_392 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_392 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_392 .cse0))))) (.cse11 (forall ((v_ArrVal_392 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_392 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse21 .cse0)) (= (select .cse21 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_392 .cse0)))))) (.cse12 (forall ((v_ArrVal_392 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_392 .cse0)))))) (let ((.cse6 (and .cse8 .cse10 .cse11 .cse12)) (.cse2 (not .cse4)) (.cse13 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_9 .cse0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_10) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_9 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (or (forall ((v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse1 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse2) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_11 (Array Int Int))) (or (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_prenex_12 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_11 (Array Int Int))) (or (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_prenex_12 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse3 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse3 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse4) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_10) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_prenex_9 4) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) (or (forall ((v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse5 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select .cse5 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse4) (or (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_16) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_15) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse4) (or .cse4 .cse6 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_9 .cse0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_10) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse4) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_8) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_7) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (or (and (forall ((v_prenex_11 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse0)) (= (select v_prenex_11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_5 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse8 (forall ((v_prenex_11 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse0)) (= (select .cse9 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_11 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)) (= (select v_prenex_11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse10 .cse11 (forall ((v_prenex_11 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse12) .cse4 .cse13) (or .cse4 (forall ((v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_11 (Array Int Int))) (or (= (select v_prenex_11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_prenex_12 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse14 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse14 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_6) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_14 (Array Int Int)) (v_prenex_13 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_14) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_13) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse4) (or (and (or .cse2 (forall ((v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse15 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse15 4) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse4 .cse6) (or .cse4 (forall ((v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_8) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_7) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (forall ((v_prenex_11 (Array Int Int))) (or (forall ((v_prenex_12 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse16 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse16 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_prenex_11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_6) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_14 (Array Int Int)) (v_prenex_13 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_14) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_13) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse4) (or (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_16) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_15) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse4) (or (forall ((v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse17 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse17 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse4) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_10) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_prenex_9 4) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_9 .cse0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_10) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_9 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (or .cse4 (and (forall ((v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_prenex_12 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_prenex_11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_prenex_12 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_12) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse18 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse18 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_9 .cse0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_10) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse4) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_16) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_15) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse19 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse19 4))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse13) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_16) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_15) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse20 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse20 4))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))))) is different from false [2023-11-12 02:27:05,190 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:27:05,191 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2023-11-12 02:27:05,194 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:27:05,202 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:27:05,202 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2023-11-12 02:27:05,221 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:27:05,222 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2023-11-12 02:27:05,236 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-12 02:27:05,236 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-11-12 02:27:05,246 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-12 02:27:05,246 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 1 [2023-11-12 02:27:05,254 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-12 02:27:05,255 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-11-12 02:27:05,273 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:27:05,274 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-12 02:27:05,277 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:27:05,281 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-11-12 02:27:05,288 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:27:05,289 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-11-12 02:27:05,301 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:27:05,301 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-12 02:27:05,304 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:27:05,307 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-11-12 02:27:05,313 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:27:05,314 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-11-12 02:27:05,328 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:27:05,328 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 02:27:05,336 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:27:05,336 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 02:27:05,347 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:27:05,347 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 02:27:05,356 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:27:05,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 02:27:05,369 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:27:05,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 02:27:05,387 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:27:05,391 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 02:27:05,403 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:27:05,404 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 02:27:05,417 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:27:05,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2023-11-12 02:27:05,429 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:27:05,429 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 02:27:05,437 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:27:05,438 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 02:27:05,446 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:27:05,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 02:27:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 10 not checked. [2023-11-12 02:27:05,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624573878] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:27:05,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:27:05,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 30 [2023-11-12 02:27:05,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399227199] [2023-11-12 02:27:05,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:27:05,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-12 02:27:05,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:27:05,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-12 02:27:05,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=676, Unknown=2, NotChecked=106, Total=870 [2023-11-12 02:27:05,762 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:27:07,752 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2023-11-12 02:27:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 02:27:07,753 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-12 02:27:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:27:07,757 INFO L225 Difference]: With dead ends: 52 [2023-11-12 02:27:07,758 INFO L226 Difference]: Without dead ends: 50 [2023-11-12 02:27:07,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=203, Invalid=1285, Unknown=2, NotChecked=150, Total=1640 [2023-11-12 02:27:07,762 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:27:07,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 121 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 402 Invalid, 0 Unknown, 81 Unchecked, 0.4s Time] [2023-11-12 02:27:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-12 02:27:07,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2023-11-12 02:27:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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-12 02:27:07,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-11-12 02:27:07,775 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2023-11-12 02:27:07,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:27:07,776 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-11-12 02:27:07,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-11-12 02:27:07,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 02:27:07,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:27:07,777 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:07,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-12 02:27:07,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:27:07,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:27:07,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2098705484, now seen corresponding path program 1 times [2023-11-12 02:27:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:07,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315521267] [2023-11-12 02:27:07,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:07,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:08,550 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:27:08,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:27:08,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315521267] [2023-11-12 02:27:08,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315521267] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:27:08,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814574365] [2023-11-12 02:27:08,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:08,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:27:08,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:27:08,552 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:27:08,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 02:27:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:08,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-12 02:27:08,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:27:08,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 02:27:08,740 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 02:27:08,740 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-12 02:27:08,761 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 02:27:08,761 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-12 02:27:08,778 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 02:27:08,779 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-12 02:27:08,843 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-12 02:27:08,843 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-12 02:27:08,868 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-11-12 02:27:08,884 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-12 02:27:08,942 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-12 02:27:08,945 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-12 02:27:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 02:27:08,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:27:09,044 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:27:09,045 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2023-11-12 02:27:09,051 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-12 02:27:09,055 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 02:27:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 7 refuted. 3 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 02:27:09,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814574365] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:27:09,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:27:09,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 22 [2023-11-12 02:27:09,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151739314] [2023-11-12 02:27:09,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:27:09,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-12 02:27:09,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:27:09,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-12 02:27:09,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=391, Unknown=6, NotChecked=0, Total=462 [2023-11-12 02:27:09,208 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 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-12 02:27:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:27:09,493 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2023-11-12 02:27:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:27:09,494 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 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 26 [2023-11-12 02:27:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:27:09,494 INFO L225 Difference]: With dead ends: 43 [2023-11-12 02:27:09,495 INFO L226 Difference]: Without dead ends: 35 [2023-11-12 02:27:09,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=620, Unknown=6, NotChecked=0, Total=756 [2023-11-12 02:27:09,496 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:27:09,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 117 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:27:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-12 02:27:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-12 02:27:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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-12 02:27:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-12 02:27:09,503 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2023-11-12 02:27:09,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:27:09,503 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-12 02:27:09,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 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-12 02:27:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-12 02:27:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-12 02:27:09,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:27:09,505 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:09,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:27:09,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-12 02:27:09,712 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:27:09,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:09,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1184035041, now seen corresponding path program 2 times [2023-11-12 02:27:09,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:09,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221079557] [2023-11-12 02:27:09,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:09,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:27:12,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:27:12,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221079557] [2023-11-12 02:27:12,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221079557] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:27:12,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838777081] [2023-11-12 02:27:12,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:27:12,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:27:12,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:27:12,363 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:27:12,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0c773f7-afe7-44b6-8547-5d1542fe0ddd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 02:27:12,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 02:27:12,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:27:12,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-12 02:27:12,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:27:12,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 02:27:12,623 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 02:27:12,624 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-12 02:27:12,669 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 02:27:12,670 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-12 02:27:12,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 02:27:12,851 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-12 02:27:12,852 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-12 02:27:12,969 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-12 02:27:12,980 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-11-12 02:27:12,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-12 02:27:13,200 INFO L322 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-12 02:27:13,200 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 22 [2023-11-12 02:27:13,230 INFO L322 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-11-12 02:27:13,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2023-11-12 02:27:13,248 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 02:27:13,248 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-12 02:27:13,509 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-12 02:27:13,510 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 80 [2023-11-12 02:27:13,548 INFO L322 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2023-11-12 02:27:13,549 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 67 [2023-11-12 02:27:13,573 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-12 02:27:13,573 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2023-11-12 02:27:14,466 INFO L322 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2023-11-12 02:27:14,466 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 199 treesize of output 142 [2023-11-12 02:27:14,486 INFO L322 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2023-11-12 02:27:14,487 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 206 treesize of output 206 [2023-11-12 02:27:14,576 INFO L322 Elim1Store]: treesize reduction 60, result has 62.5 percent of original size [2023-11-12 02:27:14,576 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 265