./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/splice-2.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_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/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_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/splice-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/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_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/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 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:32:25,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:32:25,524 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:32:25,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:32:25,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:32:25,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:32:25,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:32:25,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:32:25,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:32:25,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:32:25,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:32:25,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:32:25,583 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:32:25,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:32:25,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:32:25,585 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:32:25,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:32:25,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:32:25,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:32:25,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:32:25,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:32:25,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:32:25,588 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:32:25,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:32:25,589 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:32:25,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:32:25,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:32:25,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:32:25,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:32:25,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:32:25,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:32:25,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:32:25,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:32:25,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:32:25,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:32:25,594 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:32:25,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:32:25,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:32:25,595 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:32:25,595 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_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/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_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/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 -> 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc [2023-11-12 02:32:25,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:32:25,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:32:25,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:32:25,988 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:32:25,988 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:32:25,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/list-properties/splice-2.i [2023-11-12 02:32:29,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:32:29,450 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:32:29,453 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/sv-benchmarks/c/list-properties/splice-2.i [2023-11-12 02:32:29,479 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/data/24a0c750a/c7f62c73dc1447ab89659d76b7c2c137/FLAG95a387ed0 [2023-11-12 02:32:29,496 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/data/24a0c750a/c7f62c73dc1447ab89659d76b7c2c137 [2023-11-12 02:32:29,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:32:29,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:32:29,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:32:29,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:32:29,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:32:29,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:32:29" (1/1) ... [2023-11-12 02:32:29,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604a403f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:29, skipping insertion in model container [2023-11-12 02:32:29,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:32:29" (1/1) ... [2023-11-12 02:32:29,557 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:32:29,865 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_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2023-11-12 02:32:29,871 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:32:29,887 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:32:29,955 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_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2023-11-12 02:32:29,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:32:29,988 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:32:29,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:29 WrapperNode [2023-11-12 02:32:29,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:32:29,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:32:29,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:32:29,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:32:30,001 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:32:29" (1/1) ... [2023-11-12 02:32:30,015 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:32:29" (1/1) ... [2023-11-12 02:32:30,038 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 104 [2023-11-12 02:32:30,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:32:30,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:32:30,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:32:30,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:32:30,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:29" (1/1) ... [2023-11-12 02:32:30,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:29" (1/1) ... [2023-11-12 02:32:30,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:29" (1/1) ... [2023-11-12 02:32:30,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:29" (1/1) ... [2023-11-12 02:32:30,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:29" (1/1) ... [2023-11-12 02:32:30,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:29" (1/1) ... [2023-11-12 02:32:30,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:29" (1/1) ... [2023-11-12 02:32:30,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:29" (1/1) ... [2023-11-12 02:32:30,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:32:30,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:32:30,089 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:32:30,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:32:30,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:29" (1/1) ... [2023-11-12 02:32:30,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:32:30,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:30,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/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:32:30,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/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:32:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-12 02:32:30,204 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-12 02:32:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:32:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:32:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:32:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:32:30,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:32:30,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:32:30,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:32:30,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:32:30,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:32:30,396 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:32:30,400 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:32:30,467 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-12 02:32:30,680 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:32:30,686 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:32:30,686 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 02:32:30,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:32:30 BoogieIcfgContainer [2023-11-12 02:32:30,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:32:30,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:32:30,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:32:30,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:32:30,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:32:29" (1/3) ... [2023-11-12 02:32:30,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c642c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:32:30, skipping insertion in model container [2023-11-12 02:32:30,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:29" (2/3) ... [2023-11-12 02:32:30,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c642c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:32:30, skipping insertion in model container [2023-11-12 02:32:30,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:32:30" (3/3) ... [2023-11-12 02:32:30,699 INFO L112 eAbstractionObserver]: Analyzing ICFG splice-2.i [2023-11-12 02:32:30,719 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:32:30,719 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:32:30,771 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:32:30,778 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;@1b0a0407, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:32:30,779 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:32:30,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 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:32:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 02:32:30,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:32:30,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:32:30,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:32:30,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:30,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1192551972, now seen corresponding path program 1 times [2023-11-12 02:32:30,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:30,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443779534] [2023-11-12 02:32:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:30,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:30,988 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:32:30,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443779534] [2023-11-12 02:32:30,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443779534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:32:30,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:32:30,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:32:30,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465263705] [2023-11-12 02:32:30,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:32:30,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:32:30,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:31,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:32:31,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:32:31,030 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:32:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:31,050 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2023-11-12 02:32:31,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:32:31,052 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-12 02:32:31,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:32:31,059 INFO L225 Difference]: With dead ends: 48 [2023-11-12 02:32:31,059 INFO L226 Difference]: Without dead ends: 23 [2023-11-12 02:32:31,062 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:32:31,066 INFO L413 NwaCegarLoop]: 40 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, 40 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:32:31,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:32:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-12 02:32:31,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-12 02:32:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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:32:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-12 02:32:31,102 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2023-11-12 02:32:31,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:32:31,103 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-12 02:32:31,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:32:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-12 02:32:31,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 02:32:31,104 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:32:31,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:32:31,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:32:31,105 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:32:31,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:31,106 INFO L85 PathProgramCache]: Analyzing trace with hash 675462707, now seen corresponding path program 1 times [2023-11-12 02:32:31,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:31,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561582365] [2023-11-12 02:32:31,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:31,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:31,325 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:32:31,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:31,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561582365] [2023-11-12 02:32:31,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561582365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:32:31,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:32:31,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:32:31,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438522389] [2023-11-12 02:32:31,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:32:31,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:32:31,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:31,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:32:31,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:32:31,330 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:31,397 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2023-11-12 02:32:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:32:31,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-12 02:32:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:32:31,399 INFO L225 Difference]: With dead ends: 40 [2023-11-12 02:32:31,400 INFO L226 Difference]: Without dead ends: 33 [2023-11-12 02:32:31,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:32:31,402 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:32:31,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:32:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-12 02:32:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2023-11-12 02:32:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 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:32:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-11-12 02:32:31,411 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2023-11-12 02:32:31,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:32:31,411 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-11-12 02:32:31,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2023-11-12 02:32:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 02:32:31,413 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:32:31,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:32:31,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:32:31,414 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:32:31,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:31,415 INFO L85 PathProgramCache]: Analyzing trace with hash 577924040, now seen corresponding path program 1 times [2023-11-12 02:32:31,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:31,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265876990] [2023-11-12 02:32:31,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:31,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:31,568 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:32:31,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:31,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265876990] [2023-11-12 02:32:31,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265876990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:32:31,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:32:31,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:32:31,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388612275] [2023-11-12 02:32:31,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:32:31,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:32:31,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:31,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:32:31,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:32:31,572 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:32:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:31,630 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2023-11-12 02:32:31,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:32:31,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-12 02:32:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:32:31,633 INFO L225 Difference]: With dead ends: 47 [2023-11-12 02:32:31,633 INFO L226 Difference]: Without dead ends: 39 [2023-11-12 02:32:31,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:32:31,636 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:32:31,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 63 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:32:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-12 02:32:31,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-11-12 02:32:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2023-11-12 02:32:31,645 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 16 [2023-11-12 02:32:31,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:32:31,645 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2023-11-12 02:32:31,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:32:31,646 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2023-11-12 02:32:31,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 02:32:31,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:32:31,647 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:32:31,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:32:31,647 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:32:31,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1645466066, now seen corresponding path program 1 times [2023-11-12 02:32:31,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:31,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201669660] [2023-11-12 02:32:31,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:31,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:32,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:32,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201669660] [2023-11-12 02:32:32,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201669660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:32:32,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:32:32,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:32:32,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128800095] [2023-11-12 02:32:32,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:32:32,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:32:32,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:32,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:32:32,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:32:32,007 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:32,115 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2023-11-12 02:32:32,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:32:32,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-12 02:32:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:32:32,117 INFO L225 Difference]: With dead ends: 70 [2023-11-12 02:32:32,117 INFO L226 Difference]: Without dead ends: 43 [2023-11-12 02:32:32,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:32:32,119 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:32:32,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 78 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:32:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-12 02:32:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2023-11-12 02:32:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 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:32:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2023-11-12 02:32:32,127 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 17 [2023-11-12 02:32:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:32:32,128 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-12 02:32:32,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2023-11-12 02:32:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 02:32:32,129 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:32:32,129 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:32:32,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:32:32,130 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:32:32,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1334445095, now seen corresponding path program 1 times [2023-11-12 02:32:32,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:32,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157864001] [2023-11-12 02:32:32,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:32,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:32,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:32,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157864001] [2023-11-12 02:32:32,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157864001] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:32:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757827657] [2023-11-12 02:32:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:32,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:32:32,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:32,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:32:32,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:32:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:32,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-12 02:32:33,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:32:33,053 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:32:33,169 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:32:33,235 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 02:32:33,236 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:32:33,291 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 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 02:32:33,328 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 16 treesize of output 11 [2023-11-12 02:32:33,390 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:32:33,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:33,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:32:33,495 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_101 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_101) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-11-12 02:32:33,522 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (or (not (= v_ArrVal_100 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_100 .cse0))))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_101) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2023-11-12 02:32:33,633 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:32:33,634 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 132 treesize of output 134 [2023-11-12 02:32:33,662 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 24 treesize of output 20 [2023-11-12 02:32:33,708 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 117 treesize of output 111 [2023-11-12 02:32:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 02:32:33,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757827657] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:32:33,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:32:33,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2023-11-12 02:32:33,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972690380] [2023-11-12 02:32:33,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:32:33,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-12 02:32:33,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:33,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-12 02:32:33,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=388, Unknown=4, NotChecked=82, Total=552 [2023-11-12 02:32:33,877 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 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:32:34,438 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (= .cse0 1) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_12| Int)) (or (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_100) |v_ULTIMATE.start_main_~t~0#1.base_12| v_ArrVal_101) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_100 (store .cse1 .cse2 (select v_ArrVal_100 .cse2)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_12|) 0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~flag~0#1| .cse0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (or (not (= v_ArrVal_100 (store .cse1 .cse2 (select v_ArrVal_100 .cse2)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_101) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) is different from false [2023-11-12 02:32:34,539 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_12| Int)) (or (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_100) |v_ULTIMATE.start_main_~t~0#1.base_12| v_ArrVal_101) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_100 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_100 .cse0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_12|) 0)))) (forall ((v_ArrVal_101 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_101) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2023-11-12 02:32:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:35,052 INFO L93 Difference]: Finished difference Result 158 states and 206 transitions. [2023-11-12 02:32:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-12 02:32:35,055 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 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 23 [2023-11-12 02:32:35,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:32:35,056 INFO L225 Difference]: With dead ends: 158 [2023-11-12 02:32:35,057 INFO L226 Difference]: Without dead ends: 125 [2023-11-12 02:32:35,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=273, Invalid=1297, Unknown=6, NotChecked=316, Total=1892 [2023-11-12 02:32:35,059 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 223 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 38 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:32:35,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 239 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 389 Invalid, 3 Unknown, 370 Unchecked, 0.5s Time] [2023-11-12 02:32:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-12 02:32:35,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 77. [2023-11-12 02:32:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 76 states have internal predecessors, (100), 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:32:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2023-11-12 02:32:35,089 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 23 [2023-11-12 02:32:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:32:35,090 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2023-11-12 02:32:35,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 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:32:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2023-11-12 02:32:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 02:32:35,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:32:35,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:32:35,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 02:32:35,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:32:35,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:32:35,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1793450878, now seen corresponding path program 1 times [2023-11-12 02:32:35,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:35,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305056246] [2023-11-12 02:32:35,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:35,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:35,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:35,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305056246] [2023-11-12 02:32:35,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305056246] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:32:35,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486631221] [2023-11-12 02:32:35,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:35,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:32:35,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:35,908 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:32:35,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:32:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:36,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-12 02:32:36,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:32:36,056 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 13 treesize of output 9 [2023-11-12 02:32:36,062 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 13 treesize of output 9 [2023-11-12 02:32:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:32:36,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:32:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:32:36,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486631221] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:32:36,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:32:36,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2023-11-12 02:32:36,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234063935] [2023-11-12 02:32:36,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:32:36,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 02:32:36,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:36,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 02:32:36,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:32:36,186 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:36,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:36,617 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2023-11-12 02:32:36,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 02:32:36,618 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-12 02:32:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:32:36,623 INFO L225 Difference]: With dead ends: 125 [2023-11-12 02:32:36,623 INFO L226 Difference]: Without dead ends: 112 [2023-11-12 02:32:36,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2023-11-12 02:32:36,626 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 95 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:32:36,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 156 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:32:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-12 02:32:36,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 84. [2023-11-12 02:32:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 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:32:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2023-11-12 02:32:36,654 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 25 [2023-11-12 02:32:36,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:32:36,655 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2023-11-12 02:32:36,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:36,655 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2023-11-12 02:32:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 02:32:36,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:32:36,657 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:32:36,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:32:36,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-12 02:32:36,863 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:32:36,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:36,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1425682976, now seen corresponding path program 1 times [2023-11-12 02:32:36,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:36,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980418040] [2023-11-12 02:32:36,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:36,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:37,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:37,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980418040] [2023-11-12 02:32:37,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980418040] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:32:37,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875062956] [2023-11-12 02:32:37,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:37,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:32:37,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:37,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:32:37,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 02:32:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:37,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-12 02:32:37,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:32:37,874 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:32:37,978 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 02:32:37,979 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:32:38,037 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 15 treesize of output 1 [2023-11-12 02:32:38,041 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 15 treesize of output 1 [2023-11-12 02:32:38,116 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-12 02:32:38,117 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2023-11-12 02:32:38,124 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 23 treesize of output 15 [2023-11-12 02:32:38,131 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 32 treesize of output 19 [2023-11-12 02:32:38,225 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 31 treesize of output 19 [2023-11-12 02:32:38,230 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 19 treesize of output 11 [2023-11-12 02:32:38,273 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 16 treesize of output 11 [2023-11-12 02:32:38,309 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 7 treesize of output 3 [2023-11-12 02:32:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:38,355 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:32:38,423 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_239 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_239) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2023-11-12 02:32:38,509 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_239 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_239) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 3)) is different from false [2023-11-12 02:32:38,523 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:32:38,523 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 1 case distinctions, treesize of input 36 treesize of output 37 [2023-11-12 02:32:38,535 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:32:38,535 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 75 treesize of output 78 [2023-11-12 02:32:38,543 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 27 treesize of output 16 [2023-11-12 02:32:38,714 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:32:38,714 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 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-12 02:32:38,723 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:32:38,724 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 38 treesize of output 31 [2023-11-12 02:32:38,730 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 11 treesize of output 7 [2023-11-12 02:32:38,753 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-12 02:32:38,753 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 23 treesize of output 1 [2023-11-12 02:32:38,760 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-12 02:32:38,761 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 22 treesize of output 1 [2023-11-12 02:32:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:38,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875062956] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:32:38,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:32:38,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2023-11-12 02:32:38,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079183819] [2023-11-12 02:32:38,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:32:38,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-12 02:32:38,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:38,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-12 02:32:38,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=843, Unknown=10, NotChecked=118, Total=1056 [2023-11-12 02:32:38,964 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:40,260 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2023-11-12 02:32:40,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-12 02:32:40,261 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-12 02:32:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:32:40,262 INFO L225 Difference]: With dead ends: 145 [2023-11-12 02:32:40,262 INFO L226 Difference]: Without dead ends: 86 [2023-11-12 02:32:40,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=266, Invalid=1988, Unknown=10, NotChecked=186, Total=2450 [2023-11-12 02:32:40,264 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 127 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:32:40,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 319 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 556 Invalid, 0 Unknown, 174 Unchecked, 0.5s Time] [2023-11-12 02:32:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-12 02:32:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2023-11-12 02:32:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 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:32:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2023-11-12 02:32:40,277 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2023-11-12 02:32:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:32:40,277 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2023-11-12 02:32:40,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2023-11-12 02:32:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 02:32:40,279 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:32:40,279 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:32:40,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:32:40,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-12 02:32:40,486 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:32:40,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:40,487 INFO L85 PathProgramCache]: Analyzing trace with hash -154506453, now seen corresponding path program 2 times [2023-11-12 02:32:40,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:40,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658928144] [2023-11-12 02:32:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:40,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-12 02:32:40,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:40,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658928144] [2023-11-12 02:32:40,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658928144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:32:40,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:32:40,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:32:40,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888557960] [2023-11-12 02:32:40,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:32:40,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:32:40,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:40,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:32:40,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:32:40,550 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:32:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:40,570 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2023-11-12 02:32:40,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:32:40,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2023-11-12 02:32:40,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:32:40,571 INFO L225 Difference]: With dead ends: 126 [2023-11-12 02:32:40,572 INFO L226 Difference]: Without dead ends: 72 [2023-11-12 02:32:40,572 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:32:40,577 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:32:40,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:32:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-12 02:32:40,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2023-11-12 02:32:40,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2023-11-12 02:32:40,599 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 32 [2023-11-12 02:32:40,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:32:40,601 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2023-11-12 02:32:40,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:32:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2023-11-12 02:32:40,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 02:32:40,606 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:32:40,607 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:32:40,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:32:40,607 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:32:40,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash -972154903, now seen corresponding path program 1 times [2023-11-12 02:32:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:40,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610238240] [2023-11-12 02:32:40,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:40,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:41,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:41,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610238240] [2023-11-12 02:32:41,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610238240] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:32:41,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82957505] [2023-11-12 02:32:41,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:41,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:32:41,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:41,929 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:32:41,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cd51796-92b7-40cf-9c9a-421a0ee9c70e/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 02:32:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:42,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-12 02:32:42,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:32:42,077 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:32:42,163 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:32:42,219 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 02:32:42,220 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:32:42,257 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:32:42,265 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 15 treesize of output 1 [2023-11-12 02:32:42,350 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-12 02:32:42,351 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 24 treesize of output 17 [2023-11-12 02:32:42,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:32:42,360 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 16 treesize of output 11 [2023-11-12 02:32:42,463 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-12 02:32:42,464 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-12 02:32:42,470 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 11 [2023-11-12 02:32:42,547 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 02:32:42,550 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 17 treesize of output 16 [2023-11-12 02:32:42,568 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 02:32:42,569 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 22 [2023-11-12 02:32:42,579 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:32:42,806 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:32:42,877 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:32:42,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-11-12 02:32:43,013 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-12 02:32:43,014 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 23 treesize of output 25 [2023-11-12 02:32:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:43,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:32:43,185 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|) 1)) is different from false [2023-11-12 02:32:43,198 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base|) .cse0 (select v_ArrVal_399 .cse0))) v_ArrVal_399)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset|) 1))) is different from false [2023-11-12 02:32:43,214 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_399) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_400) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (not (= v_ArrVal_399 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_399 .cse0))))))) (= 3 |c_ULTIMATE.start_main_#t~mem8#1|)) is different from false [2023-11-12 02:32:43,228 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (or (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_399) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_400) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (not (= v_ArrVal_399 (store .cse1 .cse0 (select v_ArrVal_399 .cse0))))))) (= (select .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|) 3))) is different from false [2023-11-12 02:32:43,243 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= v_ArrVal_399 (store .cse0 .cse1 (select v_ArrVal_399 .cse1)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))) is different from false [2023-11-12 02:32:43,270 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_399 (store .cse2 .cse1 (select v_ArrVal_399 .cse1))))))) (= 3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2023-11-12 02:32:43,325 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_394 (Array Int Int)) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_393))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_51|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_394) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_399 (store .cse2 .cse1 (select v_ArrVal_399 .cse1)))) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))) is different from false [2023-11-12 02:32:43,364 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_394 (Array Int Int)) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_393))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_394) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (store .cse2 .cse1 (select v_ArrVal_399 .cse1)) v_ArrVal_399)))))) is different from false [2023-11-12 02:32:43,432 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:32:43,433 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 1 case distinctions, treesize of input 55 treesize of output 56 [2023-11-12 02:32:43,460 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:32:43,461 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 380 treesize of output 373 [2023-11-12 02:32:43,478 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 85 treesize of output 81 [2023-11-12 02:32:43,490 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 88 treesize of output 80 [2023-11-12 02:32:45,139 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse18 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (not .cse18)) (.cse19 (and (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_arrayElimCell_39 Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse35 (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_393))) (store .cse37 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse37 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399) v_arrayElimCell_39 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_51| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= v_ArrVal_399 (store .cse36 .cse3 (select v_ArrVal_399 .cse3)))) (not (= v_ArrVal_388 (store .cse4 .cse5 (select v_ArrVal_388 .cse5)))))))) .cse18) (or .cse18 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_arrayElimCell_39 Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_arrayElimCell_42 Int) (v_ArrVal_400 (Array Int Int))) (let ((.cse40 (let ((.cse41 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_393))) (store .cse41 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse41 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))))) (let ((.cse38 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399)) (.cse39 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store .cse38 v_arrayElimCell_42 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse38 v_arrayElimCell_39 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= v_ArrVal_399 (store .cse39 .cse3 (select v_ArrVal_399 .cse3)))) (not (= v_ArrVal_388 (store .cse4 .cse5 (select v_ArrVal_388 .cse5))))))))) (forall ((v_arrayElimCell_39 Int) (v_ArrVal_388 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_393 (Array Int Int))) (let ((.cse44 (let ((.cse45 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_393))) (store .cse45 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse45 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))))) (let ((.cse42 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_399 (Array Int Int))) (or (not (= v_ArrVal_399 (store .cse42 .cse3 (select v_ArrVal_399 .cse3)))) (forall ((v_arrayElimCell_42 Int) (v_ArrVal_400 (Array Int Int))) (let ((.cse43 (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399))) (or (= (select (select (store .cse43 v_arrayElimCell_42 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse43 v_arrayElimCell_39 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_41 Int)) (= (select (select (store .cse43 v_arrayElimCell_41 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))) (= 3 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= v_ArrVal_388 (store .cse4 .cse5 (select v_ArrVal_388 .cse5)))))) (forall ((v_arrayElimCell_39 Int) (v_ArrVal_388 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (forall ((v_ArrVal_393 (Array Int Int))) (let ((.cse48 (let ((.cse49 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_393))) (store .cse49 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse49 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))))) (let ((.cse46 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_399 (Array Int Int))) (or (not (= v_ArrVal_399 (store .cse46 .cse3 (select v_ArrVal_399 .cse3)))) (forall ((v_ArrVal_400 (Array Int Int))) (let ((.cse47 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399))) (or (= (select (select (store .cse47 v_arrayElimCell_39 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_41 Int)) (= (select (select (store .cse47 v_arrayElimCell_41 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))))))) (= |v_ULTIMATE.start_main_~p~0#1.base_51| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= v_ArrVal_388 (store .cse4 .cse5 (select v_ArrVal_388 .cse5))))))))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_arrayElimCell_41 Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_arrayElimCell_42 Int) (v_ArrVal_400 (Array Int Int))) (let ((.cse6 (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_393))) (store .cse7 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse7 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))))) (let ((.cse1 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399)) (.cse2 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store .cse1 v_arrayElimCell_41 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse1 v_arrayElimCell_42 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= v_ArrVal_399 (store .cse2 .cse3 (select v_ArrVal_399 .cse3)))) (not (= v_ArrVal_388 (store .cse4 .cse5 (select v_ArrVal_388 .cse5))))))))) (forall ((v_ArrVal_388 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_393 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_388))) (let ((.cse13 (store .cse10 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_393))) (let ((.cse11 (store (select .cse13 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))) (let ((.cse12 (store .cse13 |v_ULTIMATE.start_main_~p~0#1.base_51| .cse11))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_399 (Array Int Int))) (or (not (= v_ArrVal_399 (store .cse8 .cse3 (select v_ArrVal_399 .cse3)))) (forall ((v_arrayElimCell_42 Int) (v_ArrVal_400 (Array Int Int))) (let ((.cse9 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399))) (or (= (select (select (store .cse9 v_arrayElimCell_42 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_41 Int)) (= (select (select (store .cse9 v_arrayElimCell_41 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store (store (store .cse10 |v_ULTIMATE.start_main_~p~0#1.base_51| .cse11) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))) (= 3 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (not (= v_ArrVal_388 (store .cse4 .cse5 (select v_ArrVal_388 .cse5)))))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_388))) (let ((.cse17 (store .cse15 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_393))) (let ((.cse16 (store (select .cse17 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))) (let ((.cse14 (select (store .cse17 |v_ULTIMATE.start_main_~p~0#1.base_51| .cse16) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_51| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= v_ArrVal_399 (store .cse14 .cse3 (select v_ArrVal_399 .cse3)))) (= (select (select (store (store (store .cse15 |v_ULTIMATE.start_main_~p~0#1.base_51| .cse16) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_388 (store .cse4 .cse5 (select v_ArrVal_388 .cse5)))))))))) .cse18) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse19) (forall ((v_ArrVal_388 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_51| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_393 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_388))) (let ((.cse24 (store .cse22 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_393))) (let ((.cse23 (store (select .cse24 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))) (let ((.cse21 (store .cse24 |v_ULTIMATE.start_main_~p~0#1.base_51| .cse23))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_399 (Array Int Int))) (or (not (= v_ArrVal_399 (store .cse20 .cse3 (select v_ArrVal_399 .cse3)))) (forall ((v_ArrVal_400 (Array Int Int))) (or (forall ((v_arrayElimCell_41 Int)) (= (select (select (store (store .cse21 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399) v_arrayElimCell_41 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store (store (store .cse22 |v_ULTIMATE.start_main_~p~0#1.base_51| .cse23) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))))))))))) (not (= v_ArrVal_388 (store .cse4 .cse5 (select v_ArrVal_388 .cse5)))))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_arrayElimCell_42 Int) (v_ArrVal_400 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_388))) (let ((.cse29 (store .cse27 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_393))) (let ((.cse28 (store (select .cse29 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))) (let ((.cse25 (store .cse29 |v_ULTIMATE.start_main_~p~0#1.base_51| .cse28))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399) v_arrayElimCell_42 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= v_ArrVal_399 (store .cse26 .cse3 (select v_ArrVal_399 .cse3)))) (= (select (select (store (store (store .cse27 |v_ULTIMATE.start_main_~p~0#1.base_51| .cse28) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_388 (store .cse4 .cse5 (select v_ArrVal_388 .cse5))))))))))) .cse18) (forall ((v_ArrVal_388 (Array Int Int))) (or (not (= v_ArrVal_388 (store .cse4 .cse5 (select v_ArrVal_388 .cse5)))) (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_arrayElimCell_42 Int) (v_ArrVal_400 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_393))) (let ((.cse31 (store (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3))) (or (= (select (select (store (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399) v_arrayElimCell_42 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= v_ArrVal_399 (store .cse31 .cse3 (select v_ArrVal_399 .cse3)))))))))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_arrayElimCell_41 Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse32 (let ((.cse34 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_393))) (store .cse34 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse34 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_399) v_arrayElimCell_41 v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_51| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= v_ArrVal_399 (store .cse33 .cse3 (select v_ArrVal_399 .cse3)))) (not (= v_ArrVal_388 (store .cse4 .cse5 (select v_ArrVal_388 .cse5))))))))) (or .cse19 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2023-11-12 02:32:49,163 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:32:49,164 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 377 treesize of output 375 [2023-11-12 02:32:49,235 INFO L322 Elim1Store]: treesize reduction 31, result has 50.8 percent of original size [2023-11-12 02:32:49,235 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 148 [2023-11-12 02:32:49,258 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 9 treesize of output 7 [2023-11-12 02:32:49,355 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 14 treesize of output 12 [2023-11-12 02:32:49,369 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 340 treesize of output 330 [2023-11-12 02:32:49,407 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 38 treesize of output 32 [2023-11-12 02:32:49,494 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:32:49,495 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27291 treesize of output 26737 [2023-11-12 02:32:49,831 INFO L322 Elim1Store]: treesize reduction 37, result has 54.3 percent of original size [2023-11-12 02:32:49,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1468 treesize of output 1329 [2023-11-12 02:32:50,019 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 228 treesize of output 210 [2023-11-12 02:32:51,841 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 581 treesize of output 553 [2023-11-12 02:32:52,951 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 11 treesize of output 7 [2023-11-12 02:32:52,961 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 930 treesize of output 906 [2023-11-12 02:32:52,996 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 193 treesize of output 185 [2023-11-12 02:32:53,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:32:53,032 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:32:53,032 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:32:53,045 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:32:53,045 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 643 treesize of output 617 [2023-11-12 02:32:53,615 INFO L322 Elim1Store]: treesize reduction 86, result has 39.4 percent of original size [2023-11-12 02:32:53,616 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 166 treesize of output 212 [2023-11-12 02:32:53,809 INFO L322 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2023-11-12 02:32:53,809 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 520 treesize of output 462 [2023-11-12 02:32:53,898 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:32:53,951 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:32:53,951 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2717 treesize of output 2675 [2023-11-12 02:32:54,155 INFO L322 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-12 02:32:54,156 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 577 [2023-11-12 02:32:54,236 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 328 treesize of output 304 [2023-11-12 02:32:54,360 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:32:54,361 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 47 [2023-11-12 02:32:54,481 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:32:54,482 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 47 [2023-11-12 02:32:54,570 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:32:54,570 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 47 [2023-11-12 02:32:55,530 INFO L322 Elim1Store]: treesize reduction 31, result has 39.2 percent of original size [2023-11-12 02:32:55,530 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 30 treesize of output 31 [2023-11-12 02:32:55,563 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:32:55,579 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:32:55,940 INFO L322 Elim1Store]: treesize reduction 229, result has 40.4 percent of original size [2023-11-12 02:32:55,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 296 treesize of output 557 [2023-11-12 02:32:56,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:32:56,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:32:56,184 INFO L217 Elim1Store]: Index analysis took 137 ms [2023-11-12 02:32:56,291 INFO L322 Elim1Store]: treesize reduction 211, result has 4.5 percent of original size [2023-11-12 02:32:56,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 134 treesize of output 144 [2023-11-12 02:32:56,436 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:32:56,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:32:56,576 INFO L217 Elim1Store]: Index analysis took 140 ms [2023-11-12 02:32:56,664 INFO L322 Elim1Store]: treesize reduction 211, result has 4.5 percent of original size [2023-11-12 02:32:56,665 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 134 treesize of output 144 [2023-11-12 02:32:56,882 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:32:57,014 INFO L322 Elim1Store]: treesize reduction 162, result has 11.5 percent of original size [2023-11-12 02:32:57,014 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 99 treesize of output 88 [2023-11-12 02:32:57,337 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:32:57,342 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:32:57,355 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:32:57,788 INFO L322 Elim1Store]: treesize reduction 199, result has 47.8 percent of original size [2023-11-12 02:32:57,789 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 1737 treesize of output 1454 [2023-11-12 02:33:01,076 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 6 [2023-11-12 02:33:01,156 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 6 [2023-11-12 02:33:01,237 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:01,238 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:01,239 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:01,240 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:01,246 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:01,249 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:01,249 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:01,250 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:01,271 INFO L322 Elim1Store]: treesize reduction 89, result has 20.5 percent of original size [2023-11-12 02:33:01,272 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 53 [2023-11-12 02:33:01,303 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:01,377 INFO L322 Elim1Store]: treesize reduction 66, result has 37.1 percent of original size [2023-11-12 02:33:01,377 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 94 treesize of output 88 [2023-11-12 02:33:01,582 INFO L322 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2023-11-12 02:33:01,583 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 1 [2023-11-12 02:33:01,612 INFO L322 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-12 02:33:01,613 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 30 treesize of output 1 [2023-11-12 02:33:01,712 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:01,714 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:01,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:01,789 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:01,790 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1150 treesize of output 1078 [2023-11-12 02:33:02,833 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:02,834 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:02,850 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:02,851 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 867 treesize of output 841 [2023-11-12 02:33:02,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 110 treesize of output 102 [2023-11-12 02:33:03,146 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-11-12 02:33:03,150 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:03,153 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 20 [2023-11-12 02:33:03,163 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:03,200 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:03,201 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 2488 treesize of output 2446 [2023-11-12 02:33:03,342 INFO L322 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-12 02:33:03,343 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 577 [2023-11-12 02:33:03,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 219 treesize of output 203 [2023-11-12 02:33:03,627 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:03,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 47 [2023-11-12 02:33:03,734 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:03,735 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 47 [2023-11-12 02:33:03,822 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:03,822 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 47 [2023-11-12 02:33:04,408 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:04,414 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:04,457 INFO L322 Elim1Store]: treesize reduction 45, result has 55.4 percent of original size [2023-11-12 02:33:04,457 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 132 [2023-11-12 02:33:04,577 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:04,600 INFO L322 Elim1Store]: treesize reduction 33, result has 28.3 percent of original size [2023-11-12 02:33:04,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 32 [2023-11-12 02:33:04,691 INFO L322 Elim1Store]: treesize reduction 31, result has 39.2 percent of original size [2023-11-12 02:33:04,692 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 30 treesize of output 31 [2023-11-12 02:33:04,730 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:04,740 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:04,959 INFO L322 Elim1Store]: treesize reduction 184, result has 39.1 percent of original size [2023-11-12 02:33:04,960 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 163 treesize of output 318 [2023-11-12 02:33:05,226 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:05,363 INFO L322 Elim1Store]: treesize reduction 173, result has 25.8 percent of original size [2023-11-12 02:33:05,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 145 treesize of output 182 [2023-11-12 02:33:06,198 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:06,199 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:06,237 INFO L322 Elim1Store]: treesize reduction 39, result has 37.1 percent of original size [2023-11-12 02:33:06,238 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 65 treesize of output 56 [2023-11-12 02:33:06,535 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:06,535 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 10 [2023-11-12 02:33:06,564 INFO L322 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-12 02:33:06,564 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 30 treesize of output 1 [2023-11-12 02:33:06,585 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:06,585 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 15 [2023-11-12 02:33:06,660 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:06,695 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:06,745 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:06,857 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:06,858 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 4121 treesize of output 3785 [2023-11-12 02:33:08,396 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:08,396 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:08,413 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:08,413 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 1096 treesize of output 1070 [2023-11-12 02:33:08,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 219 treesize of output 203 [2023-11-12 02:33:08,768 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:08,771 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 20 [2023-11-12 02:33:08,780 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-11-12 02:33:08,798 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:08,831 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:08,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 2264 treesize of output 2222 [2023-11-12 02:33:08,957 INFO L322 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-12 02:33:08,958 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 577 [2023-11-12 02:33:08,991 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 62 treesize of output 54 [2023-11-12 02:33:09,050 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:09,050 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 37 treesize of output 47 [2023-11-12 02:33:09,245 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:09,245 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 37 treesize of output 47 [2023-11-12 02:33:09,346 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:09,347 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 37 treesize of output 47 [2023-11-12 02:33:09,990 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 11 treesize of output 7 [2023-11-12 02:33:09,997 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 143 treesize of output 139 [2023-11-12 02:33:10,024 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 87 treesize of output 83 [2023-11-12 02:33:10,038 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:10,038 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:10,055 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:10,056 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 872 treesize of output 846 [2023-11-12 02:33:10,101 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 62 treesize of output 54 [2023-11-12 02:33:10,429 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 11 treesize of output 7 [2023-11-12 02:33:10,434 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 87 treesize of output 83 [2023-11-12 02:33:10,453 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:10,454 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:10,481 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:10,481 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1381 treesize of output 1355 [2023-11-12 02:33:10,573 INFO L322 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-12 02:33:10,573 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 275 [2023-11-12 02:33:10,603 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 328 treesize of output 304 [2023-11-12 02:33:10,885 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:10,886 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 26 treesize of output 30 [2023-11-12 02:33:10,937 INFO L322 Elim1Store]: treesize reduction 37, result has 54.3 percent of original size [2023-11-12 02:33:10,938 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 94 [2023-11-12 02:33:10,981 INFO L322 Elim1Store]: treesize reduction 17, result has 26.1 percent of original size [2023-11-12 02:33:10,981 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 18 [2023-11-12 02:33:11,097 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:11,097 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 134 treesize of output 128 [2023-11-12 02:33:11,162 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:11,162 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:11,163 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:11,168 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 563 treesize of output 529 [2023-11-12 02:33:11,179 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:11,179 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 1 case distinctions, treesize of input 16 treesize of output 6 [2023-11-12 02:33:11,182 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:33:11,190 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 110 treesize of output 102 [2023-11-12 02:33:11,205 INFO L322 Elim1Store]: treesize reduction 13, result has 31.6 percent of original size [2023-11-12 02:33:11,205 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 94 [2023-11-12 02:33:11,260 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 122 treesize of output 110 [2023-11-12 02:33:11,310 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:11,311 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:11,336 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:11,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1152 treesize of output 1126 [2023-11-12 02:33:11,468 INFO L322 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-12 02:33:11,469 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 275 [2023-11-12 02:33:11,508 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 219 treesize of output 203 [2023-11-12 02:33:11,659 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:11,659 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 26 treesize of output 30 [2023-11-12 02:33:11,721 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:11,722 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 26 treesize of output 30 [2023-11-12 02:33:11,776 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:11,776 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 26 treesize of output 30 [2023-11-12 02:33:11,987 INFO L322 Elim1Store]: treesize reduction 37, result has 54.3 percent of original size [2023-11-12 02:33:11,987 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 94 [2023-11-12 02:33:12,031 INFO L322 Elim1Store]: treesize reduction 17, result has 26.1 percent of original size [2023-11-12 02:33:12,032 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 18 [2023-11-12 02:33:12,144 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:12,145 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 138 treesize of output 132 [2023-11-12 02:33:12,231 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:12,231 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:12,232 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:33:12,238 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 792 treesize of output 758 [2023-11-12 02:33:12,254 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:33:12,254 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 1 case distinctions, treesize of input 16 treesize of output 6 [2023-11-12 02:33:12,256 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:33:12,268 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 219 treesize of output 203 [2023-11-12 02:33:12,285 INFO L322 Elim1Store]: treesize reduction 13, result has 31.6 percent of original size [2023-11-12 02:33:12,285 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 94 [2023-11-12 02:33:12,369 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 122 treesize of output 110 [2023-11-12 02:33:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2023-11-12 02:33:14,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82957505] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:33:14,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:33:14,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 45 [2023-11-12 02:33:14,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806988220] [2023-11-12 02:33:14,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:33:14,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-12 02:33:14,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:14,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-12 02:33:14,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1122, Unknown=28, NotChecked=684, Total=1980 [2023-11-12 02:33:14,250 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 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)