./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:05:51,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:05:51,528 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:05:51,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:05:51,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:05:51,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:05:51,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:05:51,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:05:51,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:05:51,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:05:51,591 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:05:51,592 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:05:51,592 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:05:51,593 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:05:51,593 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:05:51,594 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:05:51,594 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:05:51,595 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:05:51,595 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:05:51,595 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:05:51,596 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:05:51,601 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:05:51,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:05:51,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:05:51,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:05:51,602 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:05:51,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:05:51,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:05:51,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:05:51,605 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:05:51,605 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:05:51,621 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:05:51,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:05:51,621 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:05:51,622 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:05:51,622 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:05:51,622 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:05:51,622 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:05:51,625 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:05:51,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:05:51,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:05:51,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:05:51,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:05:51,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:05:51,627 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:05:51,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:05:51,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:05:51,629 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:05:51,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:05:51,629 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/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_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d [2024-11-09 06:05:51,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:05:51,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:05:51,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:05:51,962 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:05:51,963 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:05:51,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c Unable to find full path for "g++" [2024-11-09 06:05:53,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:05:54,274 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:05:54,275 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2024-11-09 06:05:54,285 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/data/36e1205a5/b3f8a90a885b4ee0900b779ebf0a7e3c/FLAG2e574ced4 [2024-11-09 06:05:54,304 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/data/36e1205a5/b3f8a90a885b4ee0900b779ebf0a7e3c [2024-11-09 06:05:54,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:05:54,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:05:54,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:05:54,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:05:54,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:05:54,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:05:54" (1/1) ... [2024-11-09 06:05:54,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f474bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:05:54, skipping insertion in model container [2024-11-09 06:05:54,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:05:54" (1/1) ... [2024-11-09 06:05:54,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:05:54,702 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:05:54,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:05:54,724 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:05:54,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:05:54,810 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:05:54,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:05:54 WrapperNode [2024-11-09 06:05:54,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:05:54,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:05:54,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:05:54,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:05:54,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:05:54" (1/1) ... [2024-11-09 06:05:54,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:05:54" (1/1) ... [2024-11-09 06:05:54,892 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 236 [2024-11-09 06:05:54,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:05:54,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:05:54,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:05:54,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:05:54,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:05:54" (1/1) ... [2024-11-09 06:05:54,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:05:54" (1/1) ... [2024-11-09 06:05:54,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:05:54" (1/1) ... [2024-11-09 06:05:54,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:05:54" (1/1) ... [2024-11-09 06:05:54,935 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:05:54" (1/1) ... [2024-11-09 06:05:54,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:05:54" (1/1) ... [2024-11-09 06:05:54,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:05:54" (1/1) ... [2024-11-09 06:05:54,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:05:54" (1/1) ... [2024-11-09 06:05:54,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:05:54,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:05:54,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:05:54,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:05:54,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:05:54" (1/1) ... [2024-11-09 06:05:54,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:05:54,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:05:55,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:05:55,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:05:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:05:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 06:05:55,049 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 06:05:55,049 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 06:05:55,049 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 06:05:55,049 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 06:05:55,050 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 06:05:55,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:05:55,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:05:55,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 06:05:55,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 06:05:55,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:05:55,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:05:55,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:05:55,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:05:55,054 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:05:55,202 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:05:55,204 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:05:55,819 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:05:55,819 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:05:56,410 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:05:56,411 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 06:05:56,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:05:56 BoogieIcfgContainer [2024-11-09 06:05:56,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:05:56,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:05:56,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:05:56,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:05:56,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:05:54" (1/3) ... [2024-11-09 06:05:56,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512cac68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:05:56, skipping insertion in model container [2024-11-09 06:05:56,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:05:54" (2/3) ... [2024-11-09 06:05:56,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512cac68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:05:56, skipping insertion in model container [2024-11-09 06:05:56,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:05:56" (3/3) ... [2024-11-09 06:05:56,427 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2024-11-09 06:05:56,451 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:05:56,451 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-09 06:05:56,451 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:05:56,552 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 06:05:56,598 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 71 transitions, 163 flow [2024-11-09 06:05:56,915 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3282 states, 3202 states have (on average 3.752966895690194) internal successors, (12017), 3281 states have internal predecessors, (12017), 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) [2024-11-09 06:05:56,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:05:56,954 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@2482157f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:05:56,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-11-09 06:05:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 3282 states, 3202 states have (on average 3.752966895690194) internal successors, (12017), 3281 states have internal predecessors, (12017), 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) [2024-11-09 06:05:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 06:05:56,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:05:56,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 06:05:56,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:05:56,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:05:56,984 INFO L85 PathProgramCache]: Analyzing trace with hash 22822068, now seen corresponding path program 1 times [2024-11-09 06:05:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:05:56,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665063601] [2024-11-09 06:05:56,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:05:56,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:05:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:05:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:05:57,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:05:57,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665063601] [2024-11-09 06:05:57,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665063601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:05:57,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:05:57,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 06:05:57,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775171060] [2024-11-09 06:05:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:05:57,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:05:57,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:05:57,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:05:57,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:05:57,432 INFO L87 Difference]: Start difference. First operand has 3282 states, 3202 states have (on average 3.752966895690194) internal successors, (12017), 3281 states have internal predecessors, (12017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:05:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:05:57,771 INFO L93 Difference]: Finished difference Result 4372 states and 15471 transitions. [2024-11-09 06:05:57,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:05:57,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 06:05:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:05:57,830 INFO L225 Difference]: With dead ends: 4372 [2024-11-09 06:05:57,831 INFO L226 Difference]: Without dead ends: 3278 [2024-11-09 06:05:57,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:05:57,848 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:05:57,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:05:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2024-11-09 06:05:58,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 3278. [2024-11-09 06:05:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3201 states have (on average 3.5673227116526087) internal successors, (11419), 3277 states have internal predecessors, (11419), 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) [2024-11-09 06:05:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 11419 transitions. [2024-11-09 06:05:58,173 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 11419 transitions. Word has length 4 [2024-11-09 06:05:58,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:05:58,175 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 11419 transitions. [2024-11-09 06:05:58,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:05:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 11419 transitions. [2024-11-09 06:05:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 06:05:58,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:05:58,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 06:05:58,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:05:58,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:05:58,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:05:58,180 INFO L85 PathProgramCache]: Analyzing trace with hash 22822069, now seen corresponding path program 1 times [2024-11-09 06:05:58,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:05:58,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315687939] [2024-11-09 06:05:58,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:05:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:05:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:05:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:05:58,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:05:58,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315687939] [2024-11-09 06:05:58,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315687939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:05:58,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:05:58,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:05:58,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855230244] [2024-11-09 06:05:58,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:05:58,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:05:58,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:05:58,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:05:58,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:05:58,752 INFO L87 Difference]: Start difference. First operand 3278 states and 11419 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:05:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:05:59,035 INFO L93 Difference]: Finished difference Result 3290 states and 11435 transitions. [2024-11-09 06:05:59,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:05:59,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 06:05:59,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:05:59,072 INFO L225 Difference]: With dead ends: 3290 [2024-11-09 06:05:59,072 INFO L226 Difference]: Without dead ends: 3288 [2024-11-09 06:05:59,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:05:59,076 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:05:59,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 44 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:05:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2024-11-09 06:05:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3284. [2024-11-09 06:05:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3284 states, 3207 states have (on average 3.563766760212036) internal successors, (11429), 3283 states have internal predecessors, (11429), 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) [2024-11-09 06:05:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 3284 states and 11429 transitions. [2024-11-09 06:05:59,304 INFO L78 Accepts]: Start accepts. Automaton has 3284 states and 11429 transitions. Word has length 4 [2024-11-09 06:05:59,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:05:59,305 INFO L471 AbstractCegarLoop]: Abstraction has 3284 states and 11429 transitions. [2024-11-09 06:05:59,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:05:59,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3284 states and 11429 transitions. [2024-11-09 06:05:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:05:59,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:05:59,309 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2024-11-09 06:05:59,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:05:59,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:05:59,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:05:59,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1288141958, now seen corresponding path program 1 times [2024-11-09 06:05:59,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:05:59,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219605715] [2024-11-09 06:05:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:05:59,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:05:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:05:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:05:59,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:05:59,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219605715] [2024-11-09 06:05:59,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219605715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:05:59,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997615406] [2024-11-09 06:05:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:05:59,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:05:59,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:05:59,881 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:05:59,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:06:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:00,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:06:00,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:06:00,150 INFO L378 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 10 treesize of output 9 [2024-11-09 06:06:00,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:06:00,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:06:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:06:00,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997615406] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:06:00,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [531219742] [2024-11-09 06:06:00,832 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:259) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 06:06:00,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:06:00,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-11-09 06:06:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650386843] [2024-11-09 06:06:00,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:06:00,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:06:00,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:00,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:06:00,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:06:00,839 INFO L87 Difference]: Start difference. First operand 3284 states and 11429 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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) [2024-11-09 06:06:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:01,404 INFO L93 Difference]: Finished difference Result 6563 states and 22850 transitions. [2024-11-09 06:06:01,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:06:01,405 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 06:06:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:01,437 INFO L225 Difference]: With dead ends: 6563 [2024-11-09 06:06:01,438 INFO L226 Difference]: Without dead ends: 3286 [2024-11-09 06:06:01,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:06:01,446 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:01,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 84 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:06:01,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3286 states. [2024-11-09 06:06:01,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3286 to 3280. [2024-11-09 06:06:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3280 states, 3205 states have (on average 3.5641185647425897) internal successors, (11423), 3279 states have internal predecessors, (11423), 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) [2024-11-09 06:06:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 11423 transitions. [2024-11-09 06:06:01,628 INFO L78 Accepts]: Start accepts. Automaton has 3280 states and 11423 transitions. Word has length 7 [2024-11-09 06:06:01,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:01,628 INFO L471 AbstractCegarLoop]: Abstraction has 3280 states and 11423 transitions. [2024-11-09 06:06:01,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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) [2024-11-09 06:06:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 11423 transitions. [2024-11-09 06:06:01,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 06:06:01,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:01,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:01,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:06:01,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:06:01,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:06:01,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:01,837 INFO L85 PathProgramCache]: Analyzing trace with hash -975420006, now seen corresponding path program 1 times [2024-11-09 06:06:01,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:01,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328043506] [2024-11-09 06:06:01,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:01,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:06:01,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328043506] [2024-11-09 06:06:01,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328043506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:06:01,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:06:01,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:06:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380665730] [2024-11-09 06:06:01,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:06:01,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:06:01,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:01,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:06:01,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:06:01,992 INFO L87 Difference]: Start difference. First operand 3280 states and 11423 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:06:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:02,266 INFO L93 Difference]: Finished difference Result 6905 states and 24643 transitions. [2024-11-09 06:06:02,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:06:02,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 06:06:02,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:02,313 INFO L225 Difference]: With dead ends: 6905 [2024-11-09 06:06:02,313 INFO L226 Difference]: Without dead ends: 3589 [2024-11-09 06:06:02,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:06:02,325 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:02,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 49 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:06:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2024-11-09 06:06:02,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 3588. [2024-11-09 06:06:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3588 states, 3509 states have (on average 3.520091194072385) internal successors, (12352), 3587 states have internal predecessors, (12352), 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) [2024-11-09 06:06:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 12352 transitions. [2024-11-09 06:06:02,567 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 12352 transitions. Word has length 10 [2024-11-09 06:06:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:02,568 INFO L471 AbstractCegarLoop]: Abstraction has 3588 states and 12352 transitions. [2024-11-09 06:06:02,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:06:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 12352 transitions. [2024-11-09 06:06:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:06:02,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:02,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:02,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:06:02,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:06:02,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:02,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1447404860, now seen corresponding path program 1 times [2024-11-09 06:06:02,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:02,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076006450] [2024-11-09 06:06:02,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:02,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:06:02,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:02,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076006450] [2024-11-09 06:06:02,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076006450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:06:02,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:06:02,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 06:06:02,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825792420] [2024-11-09 06:06:02,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:06:02,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:06:02,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:02,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:06:02,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:06:02,639 INFO L87 Difference]: Start difference. First operand 3588 states and 12352 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:06:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:02,830 INFO L93 Difference]: Finished difference Result 6850 states and 24319 transitions. [2024-11-09 06:06:02,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:06:02,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 06:06:02,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:02,868 INFO L225 Difference]: With dead ends: 6850 [2024-11-09 06:06:02,869 INFO L226 Difference]: Without dead ends: 3867 [2024-11-09 06:06:02,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:06:02,880 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:02,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 34 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:06:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2024-11-09 06:06:03,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3866. [2024-11-09 06:06:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3866 states, 3771 states have (on average 3.5014584990718642) internal successors, (13204), 3865 states have internal predecessors, (13204), 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) [2024-11-09 06:06:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 13204 transitions. [2024-11-09 06:06:03,096 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 13204 transitions. Word has length 13 [2024-11-09 06:06:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:03,097 INFO L471 AbstractCegarLoop]: Abstraction has 3866 states and 13204 transitions. [2024-11-09 06:06:03,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:06:03,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 13204 transitions. [2024-11-09 06:06:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:06:03,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:03,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:03,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:06:03,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:06:03,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:03,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1838326955, now seen corresponding path program 1 times [2024-11-09 06:06:03,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:03,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534391002] [2024-11-09 06:06:03,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:03,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:06:03,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:03,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534391002] [2024-11-09 06:06:03,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534391002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:06:03,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:06:03,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:06:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329549615] [2024-11-09 06:06:03,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:06:03,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:06:03,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:03,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:06:03,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:06:03,229 INFO L87 Difference]: Start difference. First operand 3866 states and 13204 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:06:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:03,367 INFO L93 Difference]: Finished difference Result 3866 states and 13204 transitions. [2024-11-09 06:06:03,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:06:03,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 06:06:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:03,399 INFO L225 Difference]: With dead ends: 3866 [2024-11-09 06:06:03,399 INFO L226 Difference]: Without dead ends: 2974 [2024-11-09 06:06:03,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:06:03,405 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 48 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:03,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 35 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:06:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2024-11-09 06:06:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 2974. [2024-11-09 06:06:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2974 states, 2929 states have (on average 3.475930351655855) internal successors, (10181), 2973 states have internal predecessors, (10181), 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) [2024-11-09 06:06:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 10181 transitions. [2024-11-09 06:06:03,593 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 10181 transitions. Word has length 13 [2024-11-09 06:06:03,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:03,593 INFO L471 AbstractCegarLoop]: Abstraction has 2974 states and 10181 transitions. [2024-11-09 06:06:03,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:06:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 10181 transitions. [2024-11-09 06:06:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:06:03,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:03,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:03,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:06:03,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:06:03,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:03,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1838326956, now seen corresponding path program 1 times [2024-11-09 06:06:03,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:03,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037226299] [2024-11-09 06:06:03,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:03,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:06:04,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:04,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037226299] [2024-11-09 06:06:04,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037226299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:06:04,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:06:04,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:06:04,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503744127] [2024-11-09 06:06:04,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:06:04,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:06:04,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:04,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:06:04,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:06:04,009 INFO L87 Difference]: Start difference. First operand 2974 states and 10181 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:06:04,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:04,215 INFO L93 Difference]: Finished difference Result 2974 states and 10181 transitions. [2024-11-09 06:06:04,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:06:04,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 06:06:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:04,249 INFO L225 Difference]: With dead ends: 2974 [2024-11-09 06:06:04,249 INFO L226 Difference]: Without dead ends: 2194 [2024-11-09 06:06:04,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:06:04,254 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 46 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:04,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 62 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:06:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2024-11-09 06:06:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 2194. [2024-11-09 06:06:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2194 states, 2183 states have (on average 3.451213925790197) internal successors, (7534), 2193 states have internal predecessors, (7534), 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) [2024-11-09 06:06:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 7534 transitions. [2024-11-09 06:06:04,363 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 7534 transitions. Word has length 13 [2024-11-09 06:06:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:04,364 INFO L471 AbstractCegarLoop]: Abstraction has 2194 states and 7534 transitions. [2024-11-09 06:06:04,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:06:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 7534 transitions. [2024-11-09 06:06:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 06:06:04,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:04,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:04,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:06:04,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:06:04,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:04,371 INFO L85 PathProgramCache]: Analyzing trace with hash -339831122, now seen corresponding path program 1 times [2024-11-09 06:06:04,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:04,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346098345] [2024-11-09 06:06:04,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:04,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:06:04,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:04,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346098345] [2024-11-09 06:06:04,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346098345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:06:04,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:06:04,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:06:04,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592920602] [2024-11-09 06:06:04,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:06:04,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:06:04,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:04,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:06:04,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:06:04,449 INFO L87 Difference]: Start difference. First operand 2194 states and 7534 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:06:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:04,562 INFO L93 Difference]: Finished difference Result 4058 states and 14041 transitions. [2024-11-09 06:06:04,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:06:04,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 06:06:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:04,584 INFO L225 Difference]: With dead ends: 4058 [2024-11-09 06:06:04,584 INFO L226 Difference]: Without dead ends: 2120 [2024-11-09 06:06:04,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:06:04,590 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:04,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 33 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:06:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2024-11-09 06:06:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2120. [2024-11-09 06:06:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2120 states, 2109 states have (on average 3.431484115694642) internal successors, (7237), 2119 states have internal predecessors, (7237), 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) [2024-11-09 06:06:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 7237 transitions. [2024-11-09 06:06:04,671 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 7237 transitions. Word has length 15 [2024-11-09 06:06:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:04,672 INFO L471 AbstractCegarLoop]: Abstraction has 2120 states and 7237 transitions. [2024-11-09 06:06:04,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:06:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 7237 transitions. [2024-11-09 06:06:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:06:04,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:04,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:04,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:06:04,675 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:06:04,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash -967408940, now seen corresponding path program 1 times [2024-11-09 06:06:04,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:04,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277277619] [2024-11-09 06:06:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:04,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:06:04,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:04,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277277619] [2024-11-09 06:06:04,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277277619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:06:04,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:06:04,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:06:04,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421754907] [2024-11-09 06:06:04,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:06:04,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:06:04,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:04,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:06:04,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:06:04,854 INFO L87 Difference]: Start difference. First operand 2120 states and 7237 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) [2024-11-09 06:06:04,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:04,955 INFO L93 Difference]: Finished difference Result 2120 states and 7237 transitions. [2024-11-09 06:06:04,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:06:04,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-11-09 06:06:04,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:04,976 INFO L225 Difference]: With dead ends: 2120 [2024-11-09 06:06:04,977 INFO L226 Difference]: Without dead ends: 1747 [2024-11-09 06:06:04,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:06:04,980 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:04,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:06:04,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2024-11-09 06:06:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1747. [2024-11-09 06:06:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1747 states, 1742 states have (on average 3.4052812858783006) internal successors, (5932), 1746 states have internal predecessors, (5932), 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) [2024-11-09 06:06:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 5932 transitions. [2024-11-09 06:06:05,047 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 5932 transitions. Word has length 19 [2024-11-09 06:06:05,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:05,048 INFO L471 AbstractCegarLoop]: Abstraction has 1747 states and 5932 transitions. [2024-11-09 06:06:05,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) [2024-11-09 06:06:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 5932 transitions. [2024-11-09 06:06:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:06:05,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:05,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:05,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:06:05,051 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:06:05,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:05,052 INFO L85 PathProgramCache]: Analyzing trace with hash -967408939, now seen corresponding path program 1 times [2024-11-09 06:06:05,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:05,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597122334] [2024-11-09 06:06:05,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:05,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:06:05,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:05,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597122334] [2024-11-09 06:06:05,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597122334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:06:05,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:06:05,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:06:05,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191869328] [2024-11-09 06:06:05,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:06:05,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:06:05,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:05,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:06:05,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:06:05,162 INFO L87 Difference]: Start difference. First operand 1747 states and 5932 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) [2024-11-09 06:06:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:05,330 INFO L93 Difference]: Finished difference Result 3486 states and 11852 transitions. [2024-11-09 06:06:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:06:05,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-11-09 06:06:05,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:05,350 INFO L225 Difference]: With dead ends: 3486 [2024-11-09 06:06:05,350 INFO L226 Difference]: Without dead ends: 1750 [2024-11-09 06:06:05,355 INFO L431 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 [2024-11-09 06:06:05,355 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:05,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:06:05,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2024-11-09 06:06:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1746. [2024-11-09 06:06:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1741 states have (on average 3.4055140723722) internal successors, (5929), 1745 states have internal predecessors, (5929), 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) [2024-11-09 06:06:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 5929 transitions. [2024-11-09 06:06:05,423 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 5929 transitions. Word has length 19 [2024-11-09 06:06:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:05,423 INFO L471 AbstractCegarLoop]: Abstraction has 1746 states and 5929 transitions. [2024-11-09 06:06:05,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) [2024-11-09 06:06:05,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 5929 transitions. [2024-11-09 06:06:05,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 06:06:05,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:05,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:05,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:06:05,425 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:06:05,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:05,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1715366897, now seen corresponding path program 1 times [2024-11-09 06:06:05,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:05,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703775952] [2024-11-09 06:06:05,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:05,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:06:05,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:05,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703775952] [2024-11-09 06:06:05,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703775952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:06:05,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997271774] [2024-11-09 06:06:05,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:05,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:06:05,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:06:05,784 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:06:05,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:06:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:05,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 06:06:05,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:06:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:06:06,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:06:06,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997271774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:06:06,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:06:06,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-09 06:06:06,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542210536] [2024-11-09 06:06:06,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:06:06,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:06:06,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:06,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:06:06,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:06:06,183 INFO L87 Difference]: Start difference. First operand 1746 states and 5929 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:06:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:06,338 INFO L93 Difference]: Finished difference Result 1746 states and 5929 transitions. [2024-11-09 06:06:06,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:06:06,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 06:06:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:06,354 INFO L225 Difference]: With dead ends: 1746 [2024-11-09 06:06:06,354 INFO L226 Difference]: Without dead ends: 1407 [2024-11-09 06:06:06,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:06:06,357 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:06,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 56 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:06:06,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2024-11-09 06:06:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1407. [2024-11-09 06:06:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1406 states have (on average 3.375533428165007) internal successors, (4746), 1406 states have internal predecessors, (4746), 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) [2024-11-09 06:06:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 4746 transitions. [2024-11-09 06:06:06,409 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 4746 transitions. Word has length 22 [2024-11-09 06:06:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:06,410 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 4746 transitions. [2024-11-09 06:06:06,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:06:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 4746 transitions. [2024-11-09 06:06:06,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 06:06:06,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:06,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:06,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:06:06,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 06:06:06,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:06:06,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:06,621 INFO L85 PathProgramCache]: Analyzing trace with hash -4265391, now seen corresponding path program 1 times [2024-11-09 06:06:06,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:06,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331509868] [2024-11-09 06:06:06,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:06,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:06:09,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:09,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331509868] [2024-11-09 06:06:09,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331509868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:06:09,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823918262] [2024-11-09 06:06:09,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:09,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:06:09,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:06:09,029 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:06:09,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:06:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:09,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 06:06:09,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:06:09,227 INFO L378 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 [2024-11-09 06:06:09,378 INFO L378 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 23 treesize of output 1 [2024-11-09 06:06:09,607 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:06:09,608 INFO L378 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 [2024-11-09 06:06:09,768 INFO L378 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 1 [2024-11-09 06:06:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:06:11,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:06:16,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:16,627 INFO L378 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 328 treesize of output 304 [2024-11-09 06:06:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:06:17,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823918262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:06:17,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1181115926] [2024-11-09 06:06:17,293 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 06:06:17,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:06:17,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 43 [2024-11-09 06:06:17,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76204834] [2024-11-09 06:06:17,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:06:17,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 06:06:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:17,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 06:06:17,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1709, Unknown=1, NotChecked=0, Total=1892 [2024-11-09 06:06:17,300 INFO L87 Difference]: Start difference. First operand 1407 states and 4746 transitions. Second operand has 44 states, 44 states have (on average 2.5454545454545454) internal successors, (112), 43 states have internal predecessors, (112), 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) [2024-11-09 06:06:23,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:06:45,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:06:47,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:06:50,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:06:55,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:07:17,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:07:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:07:23,880 INFO L93 Difference]: Finished difference Result 5402 states and 17089 transitions. [2024-11-09 06:07:23,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-09 06:07:23,881 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.5454545454545454) internal successors, (112), 43 states have internal predecessors, (112), 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 40 [2024-11-09 06:07:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:07:23,910 INFO L225 Difference]: With dead ends: 5402 [2024-11-09 06:07:23,910 INFO L226 Difference]: Without dead ends: 5025 [2024-11-09 06:07:23,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1654 ImplicationChecksByTransitivity, 47.7s TimeCoverageRelationStatistics Valid=1006, Invalid=7723, Unknown=13, NotChecked=0, Total=8742 [2024-11-09 06:07:23,916 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 945 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 4882 mSolverCounterSat, 188 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 5076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 4882 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:07:23,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 2422 Invalid, 5076 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [188 Valid, 4882 Invalid, 6 Unknown, 0 Unchecked, 23.9s Time] [2024-11-09 06:07:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2024-11-09 06:07:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 2657. [2024-11-09 06:07:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2656 states have (on average 3.2375753012048194) internal successors, (8599), 2656 states have internal predecessors, (8599), 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) [2024-11-09 06:07:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 8599 transitions. [2024-11-09 06:07:24,059 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 8599 transitions. Word has length 40 [2024-11-09 06:07:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:07:24,060 INFO L471 AbstractCegarLoop]: Abstraction has 2657 states and 8599 transitions. [2024-11-09 06:07:24,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.5454545454545454) internal successors, (112), 43 states have internal predecessors, (112), 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) [2024-11-09 06:07:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 8599 transitions. [2024-11-09 06:07:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 06:07:24,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:07:24,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:07:24,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:07:24,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 06:07:24,276 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:07:24,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:07:24,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1531181517, now seen corresponding path program 2 times [2024-11-09 06:07:24,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:07:24,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961232281] [2024-11-09 06:07:24,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:24,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:07:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:07:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:07:27,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:07:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961232281] [2024-11-09 06:07:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961232281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:07:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74992828] [2024-11-09 06:07:27,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:07:27,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:27,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:07:27,022 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:07:27,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:07:27,134 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 06:07:27,135 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:07:27,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 06:07:27,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:07:28,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:07:28,001 INFO L378 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 36 treesize of output 32 [2024-11-09 06:07:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:07:28,371 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:07:28,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74992828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:07:28,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:07:28,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 24 [2024-11-09 06:07:28,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695525458] [2024-11-09 06:07:28,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:07:28,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:07:28,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:07:28,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:07:28,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2024-11-09 06:07:28,373 INFO L87 Difference]: Start difference. First operand 2657 states and 8599 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:07:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:07:29,435 INFO L93 Difference]: Finished difference Result 2894 states and 9222 transitions. [2024-11-09 06:07:29,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:07:29,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-09 06:07:29,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:07:29,456 INFO L225 Difference]: With dead ends: 2894 [2024-11-09 06:07:29,456 INFO L226 Difference]: Without dead ends: 2869 [2024-11-09 06:07:29,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2024-11-09 06:07:29,458 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 50 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:07:29,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 182 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 06:07:29,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2024-11-09 06:07:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 2804. [2024-11-09 06:07:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2804 states, 2803 states have (on average 3.210845522654299) internal successors, (9000), 2803 states have internal predecessors, (9000), 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) [2024-11-09 06:07:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 9000 transitions. [2024-11-09 06:07:29,549 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 9000 transitions. Word has length 40 [2024-11-09 06:07:29,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:07:29,549 INFO L471 AbstractCegarLoop]: Abstraction has 2804 states and 9000 transitions. [2024-11-09 06:07:29,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:07:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 9000 transitions. [2024-11-09 06:07:29,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 06:07:29,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:07:29,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:07:29,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 06:07:29,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 06:07:29,763 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:07:29,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:07:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 876173669, now seen corresponding path program 3 times [2024-11-09 06:07:29,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:07:29,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998934875] [2024-11-09 06:07:29,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:29,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:07:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:07:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:07:31,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:07:31,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998934875] [2024-11-09 06:07:31,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998934875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:07:31,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28840334] [2024-11-09 06:07:31,842 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 06:07:31,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:31,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:07:31,844 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:07:31,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:07:31,953 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 06:07:31,953 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:07:31,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 06:07:31,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:07:31,983 INFO L378 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 8 treesize of output 1 [2024-11-09 06:07:32,152 INFO L378 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 23 treesize of output 1 [2024-11-09 06:07:32,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:07:32,374 INFO L378 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 [2024-11-09 06:07:32,636 INFO L378 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 1 [2024-11-09 06:07:33,892 INFO L378 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 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 06:07:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:07:34,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:07:39,572 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:07:39,671 INFO L349 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2024-11-09 06:07:39,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 119 [2024-11-09 06:07:39,692 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:07:39,693 INFO L378 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 0 case distinctions, treesize of input 105 treesize of output 95 [2024-11-09 06:07:39,713 INFO L378 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 36 treesize of output 30 [2024-11-09 06:07:39,781 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-09 06:07:39,781 INFO L378 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 70 treesize of output 62 [2024-11-09 06:07:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:07:40,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28840334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:07:40,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [44689843] [2024-11-09 06:07:40,633 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 06:07:40,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:07:40,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2024-11-09 06:07:40,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153813400] [2024-11-09 06:07:40,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:07:40,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-09 06:07:40,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:07:40,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-09 06:07:40,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1637, Unknown=1, NotChecked=0, Total=1806 [2024-11-09 06:07:40,638 INFO L87 Difference]: Start difference. First operand 2804 states and 9000 transitions. Second operand has 43 states, 43 states have (on average 2.604651162790698) internal successors, (112), 42 states have internal predecessors, (112), 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) [2024-11-09 06:07:47,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:07:58,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:08:08,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:08:13,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:08:15,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:08:27,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:08:29,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:08:31,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:08:44,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:08:46,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:08:53,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:08:55,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:08:58,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:09:00,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:09:03,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:09:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:06,006 INFO L93 Difference]: Finished difference Result 6018 states and 19344 transitions. [2024-11-09 06:09:06,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-09 06:09:06,007 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.604651162790698) internal successors, (112), 42 states have internal predecessors, (112), 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 40 [2024-11-09 06:09:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:06,046 INFO L225 Difference]: With dead ends: 6018 [2024-11-09 06:09:06,047 INFO L226 Difference]: Without dead ends: 5922 [2024-11-09 06:09:06,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2422 ImplicationChecksByTransitivity, 44.3s TimeCoverageRelationStatistics Valid=1121, Invalid=9999, Unknown=10, NotChecked=0, Total=11130 [2024-11-09 06:09:06,053 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1038 mSDsluCounter, 2012 mSDsCounter, 0 mSdLazyCounter, 5850 mSolverCounterSat, 153 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 6018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 5850 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:06,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 2095 Invalid, 6018 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [153 Valid, 5850 Invalid, 15 Unknown, 0 Unchecked, 46.8s Time] [2024-11-09 06:09:06,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5922 states. [2024-11-09 06:09:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5922 to 2898. [2024-11-09 06:09:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 3.2305833620987228) internal successors, (9359), 2897 states have internal predecessors, (9359), 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) [2024-11-09 06:09:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 9359 transitions. [2024-11-09 06:09:06,208 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 9359 transitions. Word has length 40 [2024-11-09 06:09:06,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:06,209 INFO L471 AbstractCegarLoop]: Abstraction has 2898 states and 9359 transitions. [2024-11-09 06:09:06,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.604651162790698) internal successors, (112), 42 states have internal predecessors, (112), 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) [2024-11-09 06:09:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 9359 transitions. [2024-11-09 06:09:06,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 06:09:06,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:06,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:06,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 06:09:06,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 06:09:06,422 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:09:06,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:06,423 INFO L85 PathProgramCache]: Analyzing trace with hash -194285935, now seen corresponding path program 4 times [2024-11-09 06:09:06,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:06,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121937629] [2024-11-09 06:09:06,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:06,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:09,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:09,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121937629] [2024-11-09 06:09:09,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121937629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:09:09,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666367640] [2024-11-09 06:09:09,222 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 06:09:09,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:09:09,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:09:09,223 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:09:09,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:09:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:09,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 06:09:09,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:09:09,370 INFO L378 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 [2024-11-09 06:09:09,580 INFO L378 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 23 treesize of output 1 [2024-11-09 06:09:09,830 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:09:09,830 INFO L378 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 [2024-11-09 06:09:10,089 INFO L378 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 1 [2024-11-09 06:09:11,446 INFO L378 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 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 06:09:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:11,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:09:18,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:09:18,343 INFO L378 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 328 treesize of output 304 [2024-11-09 06:09:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:19,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666367640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:09:19,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [752338084] [2024-11-09 06:09:19,066 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 06:09:19,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:09:19,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 43 [2024-11-09 06:09:19,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858716576] [2024-11-09 06:09:19,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:09:19,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 06:09:19,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:19,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 06:09:19,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1713, Unknown=1, NotChecked=0, Total=1892 [2024-11-09 06:09:19,071 INFO L87 Difference]: Start difference. First operand 2898 states and 9359 transitions. Second operand has 44 states, 44 states have (on average 2.5454545454545454) internal successors, (112), 43 states have internal predecessors, (112), 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) [2024-11-09 06:09:30,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:09:39,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:09:56,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:10:37,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:10:41,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:10:46,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:10:51,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:10:51,331 INFO L93 Difference]: Finished difference Result 5686 states and 18201 transitions. [2024-11-09 06:10:51,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-11-09 06:10:51,332 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.5454545454545454) internal successors, (112), 43 states have internal predecessors, (112), 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 40 [2024-11-09 06:10:51,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:10:51,355 INFO L225 Difference]: With dead ends: 5686 [2024-11-09 06:10:51,355 INFO L226 Difference]: Without dead ends: 5567 [2024-11-09 06:10:51,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2851 ImplicationChecksByTransitivity, 61.8s TimeCoverageRelationStatistics Valid=1293, Invalid=10689, Unknown=8, NotChecked=0, Total=11990 [2024-11-09 06:10:51,360 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1020 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 5251 mSolverCounterSat, 167 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 5424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 5251 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:10:51,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 1979 Invalid, 5424 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [167 Valid, 5251 Invalid, 6 Unknown, 0 Unchecked, 37.3s Time] [2024-11-09 06:10:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5567 states. [2024-11-09 06:10:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5567 to 2949. [2024-11-09 06:10:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2948 states have (on average 3.2367706919945727) internal successors, (9542), 2948 states have internal predecessors, (9542), 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) [2024-11-09 06:10:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 9542 transitions. [2024-11-09 06:10:51,523 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 9542 transitions. Word has length 40 [2024-11-09 06:10:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:10:51,524 INFO L471 AbstractCegarLoop]: Abstraction has 2949 states and 9542 transitions. [2024-11-09 06:10:51,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.5454545454545454) internal successors, (112), 43 states have internal predecessors, (112), 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) [2024-11-09 06:10:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 9542 transitions. [2024-11-09 06:10:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 06:10:51,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:10:51,537 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:10:51,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 06:10:51,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 06:10:51,738 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:10:51,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:10:51,739 INFO L85 PathProgramCache]: Analyzing trace with hash 151506985, now seen corresponding path program 5 times [2024-11-09 06:10:51,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:10:51,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741812232] [2024-11-09 06:10:51,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:10:51,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:10:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:10:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:10:57,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:10:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741812232] [2024-11-09 06:10:57,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741812232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:10:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272930067] [2024-11-09 06:10:57,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:10:57,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:10:57,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:10:57,689 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:10:57,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:10:57,850 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 06:10:57,851 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:10:57,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 06:10:57,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:11:00,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:11:00,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272930067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:00,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:11:00,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 23 [2024-11-09 06:11:00,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86990120] [2024-11-09 06:11:00,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:00,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:11:00,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:11:00,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:11:00,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2024-11-09 06:11:00,010 INFO L87 Difference]: Start difference. First operand 2949 states and 9542 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:01,307 INFO L93 Difference]: Finished difference Result 3642 states and 11566 transitions. [2024-11-09 06:11:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:11:01,307 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-09 06:11:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:01,325 INFO L225 Difference]: With dead ends: 3642 [2024-11-09 06:11:01,325 INFO L226 Difference]: Without dead ends: 3336 [2024-11-09 06:11:01,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2024-11-09 06:11:01,328 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 51 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:01,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 139 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 06:11:01,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2024-11-09 06:11:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 2798. [2024-11-09 06:11:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 3.2656417590275293) internal successors, (9134), 2797 states have internal predecessors, (9134), 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) [2024-11-09 06:11:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 9134 transitions. [2024-11-09 06:11:01,422 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 9134 transitions. Word has length 43 [2024-11-09 06:11:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:01,423 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 9134 transitions. [2024-11-09 06:11:01,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 9134 transitions. [2024-11-09 06:11:01,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 06:11:01,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:01,433 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:01,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 06:11:01,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 06:11:01,638 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:11:01,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash 287301207, now seen corresponding path program 1 times [2024-11-09 06:11:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:11:01,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716780430] [2024-11-09 06:11:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:01,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 06:11:01,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:11:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716780430] [2024-11-09 06:11:01,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716780430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:01,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:11:01,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:11:01,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564629177] [2024-11-09 06:11:01,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:01,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:11:01,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:11:01,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:11:01,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:11:01,824 INFO L87 Difference]: Start difference. First operand 2798 states and 9134 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:02,244 INFO L93 Difference]: Finished difference Result 5281 states and 17869 transitions. [2024-11-09 06:11:02,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:11:02,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-09 06:11:02,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:02,277 INFO L225 Difference]: With dead ends: 5281 [2024-11-09 06:11:02,277 INFO L226 Difference]: Without dead ends: 4281 [2024-11-09 06:11:02,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:11:02,283 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 52 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:02,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 49 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:11:02,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2024-11-09 06:11:02,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 3693. [2024-11-09 06:11:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3692 states have (on average 3.352112676056338) internal successors, (12376), 3692 states have internal predecessors, (12376), 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) [2024-11-09 06:11:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 12376 transitions. [2024-11-09 06:11:02,439 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 12376 transitions. Word has length 44 [2024-11-09 06:11:02,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:02,440 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 12376 transitions. [2024-11-09 06:11:02,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 12376 transitions. [2024-11-09 06:11:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 06:11:02,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:02,455 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:02,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:11:02,456 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:11:02,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:02,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2142682222, now seen corresponding path program 1 times [2024-11-09 06:11:02,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:11:02,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817236077] [2024-11-09 06:11:02,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:02,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:11:02,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:11:02,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817236077] [2024-11-09 06:11:02,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817236077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:02,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3126453] [2024-11-09 06:11:02,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:02,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:02,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:11:02,834 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:11:02,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 06:11:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:02,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:11:02,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:11:03,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:11:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:11:03,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3126453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:11:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [320100324] [2024-11-09 06:11:03,953 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 06:11:03,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:11:03,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-09 06:11:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417784212] [2024-11-09 06:11:03,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:11:03,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:11:03,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:11:03,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:11:03,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:11:03,956 INFO L87 Difference]: Start difference. First operand 3693 states and 12376 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:05,146 INFO L93 Difference]: Finished difference Result 8775 states and 30345 transitions. [2024-11-09 06:11:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:11:05,147 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-09 06:11:05,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:05,168 INFO L225 Difference]: With dead ends: 8775 [2024-11-09 06:11:05,168 INFO L226 Difference]: Without dead ends: 3698 [2024-11-09 06:11:05,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:11:05,179 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 75 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:05,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 149 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 06:11:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2024-11-09 06:11:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 2920. [2024-11-09 06:11:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2919 states have (on average 3.383350462487153) internal successors, (9876), 2919 states have internal predecessors, (9876), 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) [2024-11-09 06:11:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 9876 transitions. [2024-11-09 06:11:05,297 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 9876 transitions. Word has length 44 [2024-11-09 06:11:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:05,297 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 9876 transitions. [2024-11-09 06:11:05,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 9876 transitions. [2024-11-09 06:11:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 06:11:05,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:05,339 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:05,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 06:11:05,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 06:11:05,540 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:11:05,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:05,541 INFO L85 PathProgramCache]: Analyzing trace with hash -653964759, now seen corresponding path program 1 times [2024-11-09 06:11:05,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:11:05,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515327284] [2024-11-09 06:11:05,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:05,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:11:05,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:11:05,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515327284] [2024-11-09 06:11:05,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515327284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:05,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475808273] [2024-11-09 06:11:05,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:05,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:05,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:11:05,931 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:11:05,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 06:11:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:06,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:11:06,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 06:11:06,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:11:06,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475808273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:06,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:11:06,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 06:11:06,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579808411] [2024-11-09 06:11:06,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:06,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:11:06,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:11:06,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:11:06,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:11:06,433 INFO L87 Difference]: Start difference. First operand 2920 states and 9876 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:06,784 INFO L93 Difference]: Finished difference Result 9062 states and 31936 transitions. [2024-11-09 06:11:06,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:11:06,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-09 06:11:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:06,817 INFO L225 Difference]: With dead ends: 9062 [2024-11-09 06:11:06,818 INFO L226 Difference]: Without dead ends: 6711 [2024-11-09 06:11:06,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:11:06,825 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 51 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:06,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 46 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:11:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6711 states. [2024-11-09 06:11:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6711 to 5608. [2024-11-09 06:11:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5608 states, 5607 states have (on average 3.5807026930622436) internal successors, (20077), 5607 states have internal predecessors, (20077), 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) [2024-11-09 06:11:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5608 states to 5608 states and 20077 transitions. [2024-11-09 06:11:07,045 INFO L78 Accepts]: Start accepts. Automaton has 5608 states and 20077 transitions. Word has length 45 [2024-11-09 06:11:07,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:07,045 INFO L471 AbstractCegarLoop]: Abstraction has 5608 states and 20077 transitions. [2024-11-09 06:11:07,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 5608 states and 20077 transitions. [2024-11-09 06:11:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 06:11:07,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:07,064 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:07,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 06:11:07,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:07,264 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:11:07,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:07,265 INFO L85 PathProgramCache]: Analyzing trace with hash -578892634, now seen corresponding path program 6 times [2024-11-09 06:11:07,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:11:07,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213248890] [2024-11-09 06:11:07,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:07,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:11:13,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:11:13,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213248890] [2024-11-09 06:11:13,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213248890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:13,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732405664] [2024-11-09 06:11:13,014 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 06:11:13,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:13,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:11:13,016 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:11:13,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 06:11:13,135 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 06:11:13,135 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:11:13,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 06:11:13,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:11:15,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:11:16,723 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-11-09 06:11:16,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 111 [2024-11-09 06:11:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:11:18,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732405664] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:18,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:11:18,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18, 9] total 32 [2024-11-09 06:11:18,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519674446] [2024-11-09 06:11:18,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:18,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:11:18,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:11:18,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:11:18,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=969, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 06:11:18,108 INFO L87 Difference]: Start difference. First operand 5608 states and 20077 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:21,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:11:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:22,044 INFO L93 Difference]: Finished difference Result 5682 states and 20250 transitions. [2024-11-09 06:11:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:11:22,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-09 06:11:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:22,072 INFO L225 Difference]: With dead ends: 5682 [2024-11-09 06:11:22,072 INFO L226 Difference]: Without dead ends: 5460 [2024-11-09 06:11:22,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=87, Invalid=969, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 06:11:22,075 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:22,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 159 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 511 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 06:11:22,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5460 states. [2024-11-09 06:11:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5460 to 5361. [2024-11-09 06:11:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5361 states, 5360 states have (on average 3.619776119402985) internal successors, (19402), 5360 states have internal predecessors, (19402), 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) [2024-11-09 06:11:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5361 states to 5361 states and 19402 transitions. [2024-11-09 06:11:22,263 INFO L78 Accepts]: Start accepts. Automaton has 5361 states and 19402 transitions. Word has length 46 [2024-11-09 06:11:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:22,263 INFO L471 AbstractCegarLoop]: Abstraction has 5361 states and 19402 transitions. [2024-11-09 06:11:22,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 5361 states and 19402 transitions. [2024-11-09 06:11:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 06:11:22,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:22,279 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:22,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 06:11:22,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:22,480 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:11:22,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:22,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1484585821, now seen corresponding path program 2 times [2024-11-09 06:11:22,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:11:22,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624498087] [2024-11-09 06:11:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:22,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:11:23,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:11:23,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624498087] [2024-11-09 06:11:23,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624498087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:23,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403338955] [2024-11-09 06:11:23,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:11:23,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:23,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:11:23,658 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:11:23,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 06:11:23,804 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 06:11:23,805 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:11:23,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 06:11:23,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:11:24,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:11:24,611 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 06:11:24,611 INFO L378 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 24 treesize of output 11 [2024-11-09 06:11:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:11:24,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403338955] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:11:24,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2068825744] [2024-11-09 06:11:24,763 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 06:11:24,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:11:24,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 14 [2024-11-09 06:11:24,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525777154] [2024-11-09 06:11:24,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:11:24,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 06:11:24,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:11:24,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 06:11:24,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:11:24,767 INFO L87 Difference]: Start difference. First operand 5361 states and 19402 transitions. Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 14 states have internal predecessors, (102), 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) [2024-11-09 06:11:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:27,017 INFO L93 Difference]: Finished difference Result 7751 states and 27570 transitions. [2024-11-09 06:11:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:11:27,018 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 14 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-09 06:11:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:27,052 INFO L225 Difference]: With dead ends: 7751 [2024-11-09 06:11:27,052 INFO L226 Difference]: Without dead ends: 7471 [2024-11-09 06:11:27,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2024-11-09 06:11:27,056 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 133 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:27,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 261 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 06:11:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7471 states. [2024-11-09 06:11:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7471 to 6062. [2024-11-09 06:11:27,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6062 states, 6061 states have (on average 3.5995710278831874) internal successors, (21817), 6061 states have internal predecessors, (21817), 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) [2024-11-09 06:11:27,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6062 states to 6062 states and 21817 transitions. [2024-11-09 06:11:27,295 INFO L78 Accepts]: Start accepts. Automaton has 6062 states and 21817 transitions. Word has length 47 [2024-11-09 06:11:27,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:27,295 INFO L471 AbstractCegarLoop]: Abstraction has 6062 states and 21817 transitions. [2024-11-09 06:11:27,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 14 states have internal predecessors, (102), 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) [2024-11-09 06:11:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 6062 states and 21817 transitions. [2024-11-09 06:11:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 06:11:27,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:27,316 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:27,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 06:11:27,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:27,521 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:11:27,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:27,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1467287203, now seen corresponding path program 1 times [2024-11-09 06:11:27,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:11:27,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442853662] [2024-11-09 06:11:27,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:27,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:11:27,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:11:27,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442853662] [2024-11-09 06:11:27,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442853662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:27,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334815179] [2024-11-09 06:11:27,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:27,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:27,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:11:27,927 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:11:27,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 06:11:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:28,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:11:28,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:11:28,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:11:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:11:29,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334815179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:11:29,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1899794818] [2024-11-09 06:11:29,248 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 06:11:29,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:11:29,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2024-11-09 06:11:29,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774650485] [2024-11-09 06:11:29,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:11:29,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 06:11:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:11:29,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 06:11:29,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:11:29,251 INFO L87 Difference]: Start difference. First operand 6062 states and 21817 transitions. Second operand has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 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) [2024-11-09 06:11:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:31,013 INFO L93 Difference]: Finished difference Result 13446 states and 48120 transitions. [2024-11-09 06:11:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:11:31,014 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 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 52 [2024-11-09 06:11:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:31,048 INFO L225 Difference]: With dead ends: 13446 [2024-11-09 06:11:31,048 INFO L226 Difference]: Without dead ends: 6069 [2024-11-09 06:11:31,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2024-11-09 06:11:31,066 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 206 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:31,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 160 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 06:11:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6069 states. [2024-11-09 06:11:31,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6069 to 6065. [2024-11-09 06:11:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6065 states, 6064 states have (on average 3.5982849604221636) internal successors, (21820), 6064 states have internal predecessors, (21820), 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) [2024-11-09 06:11:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6065 states to 6065 states and 21820 transitions. [2024-11-09 06:11:31,286 INFO L78 Accepts]: Start accepts. Automaton has 6065 states and 21820 transitions. Word has length 52 [2024-11-09 06:11:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:31,286 INFO L471 AbstractCegarLoop]: Abstraction has 6065 states and 21820 transitions. [2024-11-09 06:11:31,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 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) [2024-11-09 06:11:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 6065 states and 21820 transitions. [2024-11-09 06:11:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 06:11:31,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:31,305 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:31,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 06:11:31,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:31,505 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:11:31,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:31,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1451367655, now seen corresponding path program 2 times [2024-11-09 06:11:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:11:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956315643] [2024-11-09 06:11:31,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:31,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:11:35,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:11:35,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956315643] [2024-11-09 06:11:35,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956315643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:35,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088972933] [2024-11-09 06:11:35,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:11:35,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:35,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:11:35,598 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:11:35,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 06:11:35,745 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 06:11:35,745 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:11:35,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 06:11:35,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:36,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:11:36,896 INFO L378 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 34 treesize of output 30 [2024-11-09 06:11:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:11:37,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:11:38,423 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-11-09 06:11:38,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 101 [2024-11-09 06:11:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:11:39,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088972933] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:11:39,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1073441362] [2024-11-09 06:11:39,104 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 06:11:39,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:11:39,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 26 [2024-11-09 06:11:39,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955086479] [2024-11-09 06:11:39,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:11:39,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 06:11:39,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:11:39,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 06:11:39,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2024-11-09 06:11:39,107 INFO L87 Difference]: Start difference. First operand 6065 states and 21820 transitions. Second operand has 27 states, 27 states have (on average 4.407407407407407) internal successors, (119), 26 states have internal predecessors, (119), 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) [2024-11-09 06:11:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:48,530 INFO L93 Difference]: Finished difference Result 11552 states and 41908 transitions. [2024-11-09 06:11:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 06:11:48,531 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.407407407407407) internal successors, (119), 26 states have internal predecessors, (119), 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 55 [2024-11-09 06:11:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:48,577 INFO L225 Difference]: With dead ends: 11552 [2024-11-09 06:11:48,577 INFO L226 Difference]: Without dead ends: 10805 [2024-11-09 06:11:48,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=167, Invalid=1725, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 06:11:48,582 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 278 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 2087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:48,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1178 Invalid, 2087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2077 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-09 06:11:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10805 states. [2024-11-09 06:11:48,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10805 to 8133. [2024-11-09 06:11:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8133 states, 8132 states have (on average 3.6069847515986226) internal successors, (29332), 8132 states have internal predecessors, (29332), 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) [2024-11-09 06:11:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8133 states to 8133 states and 29332 transitions. [2024-11-09 06:11:48,828 INFO L78 Accepts]: Start accepts. Automaton has 8133 states and 29332 transitions. Word has length 55 [2024-11-09 06:11:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:48,829 INFO L471 AbstractCegarLoop]: Abstraction has 8133 states and 29332 transitions. [2024-11-09 06:11:48,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.407407407407407) internal successors, (119), 26 states have internal predecessors, (119), 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) [2024-11-09 06:11:48,829 INFO L276 IsEmpty]: Start isEmpty. Operand 8133 states and 29332 transitions. [2024-11-09 06:11:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 06:11:48,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:48,845 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:48,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 06:11:49,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 06:11:49,045 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:11:49,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:49,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1386852001, now seen corresponding path program 1 times [2024-11-09 06:11:49,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:11:49,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495012591] [2024-11-09 06:11:49,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:49,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:11:56,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:11:56,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495012591] [2024-11-09 06:11:56,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495012591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:56,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416742421] [2024-11-09 06:11:56,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:56,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:56,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:11:56,316 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:11:56,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 06:11:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:56,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-09 06:11:56,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:57,178 INFO L378 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 19 treesize of output 1 [2024-11-09 06:11:58,195 INFO L378 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 8 treesize of output 1 [2024-11-09 06:11:58,653 INFO L378 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 [2024-11-09 06:12:06,735 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:12:06,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:12:06,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:12:06,748 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:12:06,751 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:12:06,812 INFO L349 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2024-11-09 06:12:06,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 30 [2024-11-09 06:12:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:07,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:12:20,028 INFO L349 Elim1Store]: treesize reduction 62, result has 64.8 percent of original size [2024-11-09 06:12:20,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 641 treesize of output 542 [2024-11-09 06:13:05,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:13:05,289 INFO L378 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 168 treesize of output 120 [2024-11-09 06:13:05,488 INFO L349 Elim1Store]: treesize reduction 13, result has 71.1 percent of original size [2024-11-09 06:13:05,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 213 [2024-11-09 06:13:05,516 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:13:06,778 INFO L349 Elim1Store]: treesize reduction 18, result has 93.7 percent of original size [2024-11-09 06:13:06,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 25 case distinctions, treesize of input 189 treesize of output 392 [2024-11-09 06:13:42,805 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 06:13:42,805 INFO L378 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 157 treesize of output 1 [2024-11-09 06:13:42,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:13:42,832 INFO L378 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 164 treesize of output 116 [2024-11-09 06:13:43,053 INFO L349 Elim1Store]: treesize reduction 13, result has 71.1 percent of original size [2024-11-09 06:13:43,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 205 [2024-11-09 06:13:43,099 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:13:43,949 INFO L349 Elim1Store]: treesize reduction 91, result has 68.1 percent of original size [2024-11-09 06:13:43,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 25 case distinctions, treesize of input 193 treesize of output 321 [2024-11-09 06:13:56,288 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 06:13:56,289 INFO L378 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 152 treesize of output 1 [2024-11-09 06:13:56,341 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 06:13:56,342 INFO L378 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 238 treesize of output 1 [2024-11-09 06:13:56,382 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 06:13:56,382 INFO L378 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 194 treesize of output 1 [2024-11-09 06:13:56,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:13:56,436 INFO L378 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 157 treesize of output 109 [2024-11-09 06:13:56,466 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:13:56,497 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:13:56,634 INFO L349 Elim1Store]: treesize reduction 15, result has 48.3 percent of original size [2024-11-09 06:13:56,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 201 treesize of output 173 [2024-11-09 06:13:56,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:56,686 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:13:56,701 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:13:56,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:56,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:13:56,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 167 treesize of output 190 [2024-11-09 06:14:00,063 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:14:00,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416742421] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:14:00,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [102105576] [2024-11-09 06:14:00,064 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 06:14:00,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:14:00,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 67 [2024-11-09 06:14:00,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032442034] [2024-11-09 06:14:00,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:14:00,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-09 06:14:00,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:14:00,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-09 06:14:00,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=4168, Unknown=3, NotChecked=0, Total=4556 [2024-11-09 06:14:00,071 INFO L87 Difference]: Start difference. First operand 8133 states and 29332 transitions. Second operand has 68 states, 68 states have (on average 2.4705882352941178) internal successors, (168), 67 states have internal predecessors, (168), 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) [2024-11-09 06:14:23,742 WARN L286 SmtUtils]: Spent 13.87s on a formula simplification. DAG size of input: 337 DAG size of output: 766 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:14:41,772 WARN L286 SmtUtils]: Spent 14.88s on a formula simplification. DAG size of input: 522 DAG size of output: 950 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:14:43,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:14:45,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:14:51,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:14:53,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:14:55,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:15:15,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:15:34,100 WARN L286 SmtUtils]: Spent 13.27s on a formula simplification. DAG size of input: 515 DAG size of output: 917 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:15:41,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:15:42,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:15:45,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:15:48,414 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~q1_front~0 4)) (.cse64 (* c_~q1_back~0 4))) (let ((.cse70 (* c_~q2_back~0 4)) (.cse33 (* c_~q2_front~0 4)) (.cse253 (+ c_~q2_back~0 1)) (.cse68 (+ c_~q1_front~0 1)) (.cse77 (+ .cse64 c_~q1~0.offset)) (.cse80 (+ .cse1 c_~q1~0.offset 4)) (.cse81 (+ .cse1 c_~q1~0.offset)) (.cse0 (select |c_#memory_int| c_~q1~0.base)) (.cse36 (+ c_~q1_back~0 1)) (.cse66 (= c_~q2_front~0 0))) (let ((.cse4 (not .cse66)) (.cse6 (= c_~s~0 0)) (.cse5 (< c_~n2~0 3)) (.cse2 (+ c_~q2_front~0 c_~n2~0)) (.cse3 (+ c_~q2_back~0 2)) (.cse25 (not (= c_~q2_back~0 0))) (.cse11 (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (not (= (select .cse0 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36)))) (.cse19 (select .cse0 .cse81)) (.cse23 (select .cse0 .cse80)) (.cse12 (not (= (select .cse0 .cse77) 2))) (.cse7 (< c_~n1~0 .cse68)) (.cse9 (< c_~q2_back~0 0)) (.cse10 (< c_~q1_front~0 0)) (.cse67 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse13 (< c_~q1_back~0 0)) (.cse20 (= .cse253 c_~n2~0)) (.cse22 (< c_~n2~0 .cse253)) (.cse17 (+ .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse21 (+ .cse70 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (* c_~t~0 2)) (.cse16 (+ .cse33 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse24 (+ .cse70 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (= c_~q2~0.offset 0) (= (select .cse0 (+ .cse1 (- 4))) 2) (<= .cse2 .cse3) (exists ((v_~q1_back~0_177 Int)) (and (<= c_~q1_front~0 v_~q1_back~0_177) (<= v_~q1_back~0_177 1) (= (select .cse0 (* v_~q1_back~0_177 4)) 0))) (or (and (or .cse4 .cse5) (or (not (= c_~q1_front~0 0)) .cse6) (<= c_~q1_front~0 0)) (not (= c_~q1_back~0 0))) (= c_~q1~0.offset 0) (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse18 (select .cse15 .cse24))) (let ((.cse8 (+ .cse18 1))) (or .cse7 (< 0 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 (= (+ .cse14 (* (select .cse15 .cse16) 2) (* (select .cse15 .cse17) 2) 1) (+ c_~s~0 .cse18 .cse19)) .cse20 (not (= (+ (select .cse15 .cse21) 1) .cse19)) .cse22 (< .cse8 .cse23))))) (<= 1 c_~q1_front~0) (or .cse7 .cse10 .cse13 .cse25 (let ((.cse26 (= c_~q2_front~0 1)) (.cse32 (+ .cse33 4)) (.cse29 (+ .cse1 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse34 (+ .cse64 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse35 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse26 (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((v_subst_78 Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| v_subst_78 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse31 (select v_arrayElimArr_2 4))) (let ((.cse27 (+ .cse31 1)) (.cse30 (select .cse28 .cse35))) (or (< .cse27 (select .cse28 .cse29)) (not (= (select .cse28 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (< 0 .cse27) (= (+ c_~s~0 .cse30 .cse31) (+ .cse14 (* 2 (select v_arrayElimArr_2 .cse32)) 1 (* (select v_arrayElimArr_2 .cse33) 2))) (not (= (+ (select v_arrayElimArr_2 0) 1) .cse30)) (not (= 2 (select .cse28 .cse34))))))) (< v_~q1_back~0_178 .cse36)))) (or .cse4 (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_64 Int)) (let ((.cse40 (select v_arrayElimArr_2 4)) (.cse37 (select (store |c_#memory_int| v_subst_64 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse38 (select .cse37 .cse35)) (.cse39 (select v_arrayElimArr_2 0)) (.cse41 (+ .cse40 1))) (or (not (= (select .cse37 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (= (+ c_~s~0 .cse38) (+ .cse14 (* 2 .cse39) .cse40 1)) (not (= (select .cse37 .cse34) 2)) (not (= .cse38 (+ .cse39 1))) (< .cse41 (select .cse37 .cse29)) (< 0 .cse41))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse36)))) (or .cse4 (forall ((v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int) (v_subst_54 Int)) (let ((.cse44 (select v_arrayElimArr_2 4)) (.cse43 (select (store |c_#memory_int| v_subst_54 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse42 (select .cse43 .cse35)) (.cse45 (+ .cse44 1))) (or (not (= (+ (select v_arrayElimArr_2 0) 1) .cse42)) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (not (= (select .cse43 .cse34) 2)) (= (+ c_~s~0 1) (+ .cse14 .cse42 .cse44)) (< .cse45 (select .cse43 .cse29)) (< 0 .cse45) (< v_~q1_back~0_178 .cse36) (not (= (select .cse43 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0))))))) (or (not .cse26) (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_66 Int)) (let ((.cse49 (select (store |c_#memory_int| v_subst_66 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse47 (select v_arrayElimArr_2 4))) (let ((.cse48 (+ .cse47 1)) (.cse46 (select .cse49 .cse35))) (or (= (+ c_~s~0 .cse46) (+ .cse14 (* 2 (select v_arrayElimArr_2 8)) .cse47 1)) (< .cse48 (select .cse49 .cse29)) (not (= (select .cse49 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (< 0 .cse48) (not (= (select .cse49 .cse34) 2)) (not (= (+ (select v_arrayElimArr_2 0) 1) .cse46)))))) (< v_~q1_back~0_178 .cse36)))) (or .cse26 (and (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse54 (select v_arrayElimArr_2 4))) (let ((.cse52 (+ .cse54 1))) (or (forall ((v_subst_52 Int)) (let ((.cse50 (select (store |c_#memory_int| v_subst_52 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse51 (select .cse50 .cse35)) (.cse53 (* 2 (select v_arrayElimArr_2 .cse32)))) (or (not (= 2 (select .cse50 .cse34))) (not (= (select .cse50 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (not (= (+ (select v_arrayElimArr_2 .cse33) 1) .cse51)) (not (= (+ (select v_arrayElimArr_2 0) 1) .cse51)) (< .cse52 (select .cse50 .cse29)) (= (+ c_~s~0 .cse51) (+ .cse14 .cse53 .cse54 1)) (= (+ c_~s~0 .cse54 1) (+ .cse14 .cse51 .cse53)))))) (< 0 .cse52))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse36))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int) (v_subst_53 Int)) (let ((.cse55 (select (store |c_#memory_int| v_subst_53 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse57 (select v_arrayElimArr_2 4))) (let ((.cse56 (+ .cse57 1)) (.cse58 (select .cse55 .cse35))) (or (not (= (select .cse55 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (not (= 2 (select .cse55 .cse34))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< .cse56 (select .cse55 .cse29)) (= (+ c_~s~0 .cse57 1) (+ .cse14 (* 2 (select v_arrayElimArr_2 .cse32)) .cse58)) (not (= (+ (select v_arrayElimArr_2 .cse33) 1) .cse58)) (< 0 .cse56) (< v_~q1_back~0_178 .cse36) (not (= (+ (select v_arrayElimArr_2 0) 1) .cse58)))))))) (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_63 Int)) (let ((.cse61 (select (store |c_#memory_int| v_subst_63 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse63 (select v_arrayElimArr_2 4))) (let ((.cse62 (+ .cse63 1)) (.cse59 (select v_arrayElimArr_2 0)) (.cse60 (select .cse61 .cse35))) (or (not (= .cse59 (select v_arrayElimArr_2 .cse32))) (not (= (+ .cse59 1) .cse60)) (not (= (select .cse61 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (< .cse62 (select .cse61 .cse29)) (not (= 2 (select .cse61 .cse34))) (< 0 .cse62) (= (+ .cse14 (* 2 .cse59) 1 (* (select v_arrayElimArr_2 .cse33) 2)) (+ c_~s~0 .cse60 .cse63)))))) (< v_~q1_back~0_178 .cse36)))))) .cse6 (<= c_~n2~0 2) (or .cse5 (< .cse2 .cse3)) (= c_~q2_front~0 c_~q2_back~0) (or .cse7 (let ((.cse65 (< c_~n1~0 (+ c_~q1_back~0 2)))) (and (or (= c_~s~0 .cse14) .cse65) (or .cse65 (= c_~q1_back~0 c_~q1_front~0)) (or .cse65 .cse66) (or (< c_~n1~0 (+ 3 c_~q1_front~0)) .cse65))) .cse10 .cse67 .cse13 .cse25 (= c_~q1_back~0 .cse68)) (= 2 |c_thread2Thread1of1ForFork0_~j~0#1|) (let ((.cse69 (select |c_#memory_int| c_~q2~0.base))) (let ((.cse71 (select .cse69 (+ .cse70 c_~q2~0.offset 4)))) (let ((.cse72 (+ .cse71 1))) (or (not (= .cse19 (+ (select .cse69 (+ .cse70 c_~q2~0.offset)) 1))) .cse7 .cse9 .cse10 .cse11 (= (+ .cse14 (* (select .cse69 (+ c_~q2~0.offset .cse33)) 2) (* 2 (select .cse69 (+ c_~q2~0.offset .cse33 4))) 1) (+ c_~s~0 .cse71 .cse19)) (< .cse72 .cse23) .cse12 .cse13 .cse20 .cse22 (< 0 .cse72))))) (= c_~t~0 0) (or (< c_~n1~0 3) (< c_~q1_back~0 1)) (or .cse7 .cse9 .cse10 .cse67 .cse13 .cse20 .cse22 (let ((.cse252 (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (let ((.cse74 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse73 (= c_~q2_front~0 .cse252)) (.cse125 (= c_~q2_back~0 .cse252))) (let ((.cse102 (not (= c_~q2_front~0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (.cse88 (not .cse125)) (.cse87 (not .cse73)) (.cse176 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse249 (select v_arrayElimArr_2 .cse24)) (.cse246 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse247 (select .cse246 .cse81)) (.cse250 (+ .cse249 1)) (.cse248 (select v_arrayElimArr_2 .cse74)) (.cse251 (select .cse246 .cse80))) (or (not (= 2 (select .cse246 .cse77))) (not (= .cse247 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse14 (* 2 .cse248) (* (select v_arrayElimArr_2 .cse16) 2) 1) (+ c_~s~0 .cse247 .cse249)) (< 0 .cse250) (< .cse250 .cse251) (not (= (select .cse246 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36) (< (+ .cse248 1) .cse251)))))) (.cse126 (= c_~q2_back~0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (or (and (or (and (or .cse73 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse78 (select v_arrayElimArr_2 .cse24)) (.cse76 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse75 (select .cse76 .cse81)) (.cse79 (+ .cse78 1))) (or (not (= (+ (select v_arrayElimArr_2 .cse74) 1) .cse75)) (not (= 2 (select .cse76 .cse77))) (= (+ c_~s~0 .cse75 .cse78) (+ .cse14 (* (select v_arrayElimArr_2 .cse16) 2) 1 (* (select v_arrayElimArr_2 .cse17) 2))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse79) (< .cse79 (select .cse76 .cse80)) (not (= (select .cse76 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36)))))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse85 (select v_arrayElimArr_2 .cse24)) (.cse84 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse82 (select v_arrayElimArr_2 .cse74)) (.cse83 (select .cse84 .cse81)) (.cse86 (+ .cse85 1))) (or (not (= (+ .cse82 1) .cse83)) (not (= 2 (select .cse84 .cse77))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse14 (* 2 .cse82) (* (select v_arrayElimArr_2 .cse16) 2) 1) (+ c_~s~0 .cse83 .cse85)) (< 0 .cse86) (< .cse86 (select .cse84 .cse80)) (not (= (select .cse84 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36))))) .cse87)) .cse88) (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse91 (select v_arrayElimArr_2 .cse24))) (let ((.cse93 (+ .cse91 1)) (.cse92 (select v_arrayElimArr_2 .cse21))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (let ((.cse89 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse90 (select .cse89 .cse81))) (or (not (= 2 (select .cse89 .cse77))) (= (+ c_~s~0 .cse90 .cse91) (+ .cse14 (* .cse92 2) 1 (* (select v_arrayElimArr_2 .cse17) 2))) (not (= .cse90 (+ .cse92 1))) (< .cse93 (select .cse89 .cse80)) (not (= (select .cse89 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)))))) (< 0 .cse93) (not (= .cse92 (select v_arrayElimArr_2 .cse16))))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse36))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse96 (select v_arrayElimArr_2 .cse24)) (.cse94 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse95 (select .cse94 .cse81)) (.cse97 (+ .cse96 1))) (or (not (= 2 (select .cse94 .cse77))) (not (= .cse95 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse14 (* 2 (select v_arrayElimArr_2 .cse74)) (* (select v_arrayElimArr_2 .cse16) 2) 1) (+ c_~s~0 .cse95 .cse96)) (< 0 .cse97) (< .cse97 (select .cse94 .cse80)) (not (= (select .cse94 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36))))) .cse87) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse100 (select v_arrayElimArr_2 .cse24)) (.cse98 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse99 (select .cse98 .cse81)) (.cse101 (+ .cse100 1))) (or (not (= 2 (select .cse98 .cse77))) (= (+ c_~s~0 .cse99 .cse100) (+ .cse14 (* (select v_arrayElimArr_2 .cse16) 2) 1 (* (select v_arrayElimArr_2 .cse17) 2))) (not (= .cse99 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse101) (< .cse101 (select .cse98 .cse80)) (not (= (select .cse98 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36))))) .cse73) (or .cse102 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse105 (select v_arrayElimArr_2 .cse24)) (.cse103 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse104 (select .cse103 .cse81)) (.cse106 (+ .cse105 1))) (or (not (= 2 (select .cse103 .cse77))) (not (= .cse104 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse104 .cse105) (+ .cse14 (* 2 (select v_arrayElimArr_2 .cse74)) 1 (* (select v_arrayElimArr_2 .cse17) 2))) (< 0 .cse106) (< .cse106 (select .cse103 .cse80)) (not (= (select .cse103 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36)))))) (or (and (or .cse102 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse109 (select v_arrayElimArr_2 .cse24)) (.cse107 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse108 (select .cse107 .cse81)) (.cse110 (+ .cse109 1))) (or (not (= 2 (select .cse107 .cse77))) (not (= (+ (select v_arrayElimArr_2 .cse17) 1) .cse108)) (not (= .cse108 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse109 1) (+ .cse14 (* 2 (select v_arrayElimArr_2 .cse74)) .cse108)) (< 0 .cse110) (< .cse110 (select .cse107 .cse80)) (not (= (select .cse107 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36)))))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse111 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse114 (select v_arrayElimArr_2 .cse24))) (let ((.cse113 (+ .cse114 1)) (.cse112 (select .cse111 .cse81))) (or (not (= 2 (select .cse111 .cse77))) (not (= (+ (select v_arrayElimArr_2 .cse17) 1) .cse112)) (not (= .cse112 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse113) (< .cse113 (select .cse111 .cse80)) (not (= (select .cse111 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse14 (* (select v_arrayElimArr_2 .cse16) 2) .cse112) (+ c_~s~0 .cse114 1)) (< v_~q1_back~0_178 .cse36))))) .cse73) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse115 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse118 (select v_arrayElimArr_2 .cse24))) (let ((.cse119 (+ .cse118 1)) (.cse117 (* (select v_arrayElimArr_2 .cse16) 2)) (.cse116 (select .cse115 .cse81))) (or (not (= 2 (select .cse115 .cse77))) (not (= .cse116 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse14 (* 2 (select v_arrayElimArr_2 .cse74)) .cse117 1) (+ c_~s~0 .cse116 .cse118)) (< 0 .cse119) (< .cse119 (select .cse115 .cse80)) (not (= (select .cse115 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse14 .cse117 .cse116) (+ c_~s~0 .cse118 1)) (< v_~q1_back~0_178 .cse36))))) .cse87) (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse123 (select v_arrayElimArr_2 .cse24))) (let ((.cse124 (+ .cse123 1))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (let ((.cse120 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse122 (* (select v_arrayElimArr_2 .cse16) 2)) (.cse121 (select .cse120 .cse81))) (or (not (= 2 (select .cse120 .cse77))) (not (= (+ (select v_arrayElimArr_2 .cse17) 1) .cse121)) (not (= .cse121 (+ (select v_arrayElimArr_2 .cse21) 1))) (= (+ .cse14 (* 2 (select v_arrayElimArr_2 .cse74)) .cse122 1) (+ c_~s~0 .cse121 .cse123)) (< .cse124 (select .cse120 .cse80)) (not (= (select .cse120 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse14 .cse122 .cse121) (+ c_~s~0 .cse123 1)))))) (< 0 .cse124))))) (< v_~q1_back~0_178 .cse36)))) .cse125)) .cse126) (or (and (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse130 (select v_arrayElimArr_2 .cse74)) (.cse129 (select v_arrayElimArr_2 .cse24)) (.cse127 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse128 (select .cse127 .cse81)) (.cse131 (+ .cse129 1)) (.cse133 (+ .cse130 1)) (.cse132 (select .cse127 .cse80))) (or (not (= 2 (select .cse127 .cse77))) (not (= (+ (select v_arrayElimArr_2 .cse17) 1) .cse128)) (not (= .cse128 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse129 1) (+ .cse14 (* 2 .cse130) .cse128)) (< 0 .cse131) (< .cse131 .cse132) (not (= (select .cse127 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36) (< 0 .cse133) (< .cse133 .cse132))))) .cse102) (or (and (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse136 (select v_arrayElimArr_2 .cse74)) (.cse138 (select v_arrayElimArr_2 .cse24))) (let ((.cse139 (+ .cse138 1)) (.cse141 (+ .cse136 1))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (let ((.cse134 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse137 (* (select v_arrayElimArr_2 .cse16) 2)) (.cse135 (select .cse134 .cse81)) (.cse140 (select .cse134 .cse80))) (or (not (= 2 (select .cse134 .cse77))) (not (= (+ (select v_arrayElimArr_2 .cse17) 1) .cse135)) (not (= .cse135 (+ (select v_arrayElimArr_2 .cse21) 1))) (= (+ .cse14 (* 2 .cse136) .cse137 1) (+ c_~s~0 .cse135 .cse138)) (< .cse139 .cse140) (not (= (select .cse134 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse14 .cse137 .cse135) (+ c_~s~0 .cse138 1)) (< .cse141 .cse140))))) (< 0 .cse139) (< 0 .cse141))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse36))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse144 (select v_arrayElimArr_2 .cse74)) (.cse142 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse146 (select v_arrayElimArr_2 .cse24))) (let ((.cse147 (+ .cse146 1)) (.cse145 (* (select v_arrayElimArr_2 .cse16) 2)) (.cse143 (select .cse142 .cse81)) (.cse149 (+ .cse144 1)) (.cse148 (select .cse142 .cse80))) (or (not (= 2 (select .cse142 .cse77))) (not (= .cse143 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse14 (* 2 .cse144) .cse145 1) (+ c_~s~0 .cse143 .cse146)) (< 0 .cse147) (< .cse147 .cse148) (not (= (select .cse142 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse14 .cse145 .cse143) (+ c_~s~0 .cse146 1)) (< v_~q1_back~0_178 .cse36) (< 0 .cse149) (< .cse149 .cse148))))) .cse87) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse152 (select v_arrayElimArr_2 .cse74)) (.cse153 (select v_arrayElimArr_2 .cse24)) (.cse150 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse151 (select .cse150 .cse81)) (.cse154 (+ .cse153 1)) (.cse156 (+ .cse152 1)) (.cse155 (select .cse150 .cse80))) (or (not (= 2 (select .cse150 .cse77))) (not (= .cse151 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse14 (* 2 .cse152) (* (select v_arrayElimArr_2 .cse16) 2) 1) (+ c_~s~0 .cse151 .cse153)) (< 0 .cse154) (< .cse154 .cse155) (not (= (select .cse150 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36) (< 0 .cse156) (< .cse156 .cse155))))) .cse87) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse157 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse161 (select v_arrayElimArr_2 .cse24))) (let ((.cse159 (+ .cse161 1)) (.cse158 (select .cse157 .cse81)) (.cse162 (+ (select v_arrayElimArr_2 .cse74) 1)) (.cse160 (select .cse157 .cse80))) (or (not (= 2 (select .cse157 .cse77))) (not (= (+ (select v_arrayElimArr_2 .cse17) 1) .cse158)) (not (= .cse158 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse159) (< .cse159 .cse160) (not (= (select .cse157 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse14 (* (select v_arrayElimArr_2 .cse16) 2) .cse158) (+ c_~s~0 .cse161 1)) (< v_~q1_back~0_178 .cse36) (< 0 .cse162) (< .cse162 .cse160))))) .cse73)) (and .cse126 .cse73)) (or .cse126 (and (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse165 (select v_arrayElimArr_2 .cse24)) (.cse163 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse164 (select .cse163 .cse81)) (.cse167 (+ .cse165 1)) (.cse166 (select v_arrayElimArr_2 .cse74)) (.cse168 (select .cse163 .cse80))) (or (not (= 2 (select .cse163 .cse77))) (not (= (+ (select v_arrayElimArr_2 .cse17) 1) .cse164)) (not (= .cse164 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse165 1) (+ .cse14 (* 2 .cse166) .cse164)) (< 0 .cse167) (< .cse167 .cse168) (not (= (select .cse163 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36) (< (+ .cse166 1) .cse168))))) .cse102) (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse173 (select v_arrayElimArr_2 .cse24))) (let ((.cse174 (+ .cse173 1))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (let ((.cse169 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse172 (* (select v_arrayElimArr_2 .cse16) 2)) (.cse170 (select .cse169 .cse81)) (.cse171 (select v_arrayElimArr_2 .cse74)) (.cse175 (select .cse169 .cse80))) (or (not (= 2 (select .cse169 .cse77))) (not (= (+ (select v_arrayElimArr_2 .cse17) 1) .cse170)) (not (= .cse170 (+ (select v_arrayElimArr_2 .cse21) 1))) (= (+ .cse14 (* 2 .cse171) .cse172 1) (+ c_~s~0 .cse170 .cse173)) (< .cse174 .cse175) (not (= (select .cse169 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse14 .cse172 .cse170) (+ c_~s~0 .cse173 1)) (< (+ .cse171 1) .cse175))))) (< 0 .cse174))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse36))) (or .cse176 .cse87) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse177 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse181 (select v_arrayElimArr_2 .cse24))) (let ((.cse182 (+ .cse181 1)) (.cse180 (* (select v_arrayElimArr_2 .cse16) 2)) (.cse178 (select .cse177 .cse81)) (.cse179 (select v_arrayElimArr_2 .cse74)) (.cse183 (select .cse177 .cse80))) (or (not (= 2 (select .cse177 .cse77))) (not (= .cse178 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse14 (* 2 .cse179) .cse180 1) (+ c_~s~0 .cse178 .cse181)) (< 0 .cse182) (< .cse182 .cse183) (not (= (select .cse177 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse14 .cse180 .cse178) (+ c_~s~0 .cse181 1)) (< v_~q1_back~0_178 .cse36) (< (+ .cse179 1) .cse183))))) .cse87) (or .cse73 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse184 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse188 (select v_arrayElimArr_2 .cse24))) (let ((.cse186 (+ .cse188 1)) (.cse185 (select .cse184 .cse81)) (.cse187 (select .cse184 .cse80))) (or (not (= 2 (select .cse184 .cse77))) (not (= (+ (select v_arrayElimArr_2 .cse17) 1) .cse185)) (not (= .cse185 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse186) (< .cse186 .cse187) (not (= (select .cse184 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse14 (* (select v_arrayElimArr_2 .cse16) 2) .cse185) (+ c_~s~0 .cse188 1)) (< v_~q1_back~0_178 .cse36) (< (+ (select v_arrayElimArr_2 .cse74) 1) .cse187))))))))) .cse125) (or .cse126 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse191 (select v_arrayElimArr_2 .cse24)) (.cse189 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse190 (select .cse189 .cse81)) (.cse193 (+ .cse191 1)) (.cse192 (select v_arrayElimArr_2 .cse21)) (.cse194 (select .cse189 .cse80))) (or (not (= 2 (select .cse189 .cse77))) (= (+ c_~s~0 .cse190 .cse191) (+ .cse14 (* .cse192 2) 1 (* (select v_arrayElimArr_2 .cse17) 2))) (not (= .cse190 (+ .cse192 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse193) (< .cse193 .cse194) (not (= .cse192 (select v_arrayElimArr_2 .cse16))) (not (= (select .cse189 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36) (< (+ (select v_arrayElimArr_2 .cse74) 1) .cse194)))))) (or (and (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse198 (select v_arrayElimArr_2 .cse74)) (.cse197 (select v_arrayElimArr_2 .cse24)) (.cse195 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse196 (select .cse195 .cse81)) (.cse199 (+ .cse197 1)) (.cse201 (+ .cse198 1)) (.cse200 (select .cse195 .cse80))) (or (not (= 2 (select .cse195 .cse77))) (not (= .cse196 (+ (select v_arrayElimArr_2 .cse21) 1))) (= (+ c_~s~0 .cse196 .cse197) (+ .cse14 (* 2 .cse198) 1 (* (select v_arrayElimArr_2 .cse17) 2))) (< 0 .cse199) (< .cse199 .cse200) (not (= (select .cse195 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< 0 .cse201) (< .cse201 .cse200))))) (< v_~q1_back~0_178 .cse36))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse204 (select v_arrayElimArr_2 .cse24)) (.cse202 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse203 (select .cse202 .cse81)) (.cse206 (+ .cse204 1)) (.cse205 (select v_arrayElimArr_2 .cse74)) (.cse207 (select .cse202 .cse80))) (or (not (= 2 (select .cse202 .cse77))) (not (= .cse203 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse203 .cse204) (+ .cse14 (* 2 .cse205) 1 (* (select v_arrayElimArr_2 .cse17) 2))) (< 0 .cse206) (< .cse206 .cse207) (not (= (select .cse202 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36) (< (+ .cse205 1) .cse207))))) .cse126)) .cse102) (forall ((v_~q1_back~0_178 Int)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse210 (select v_arrayElimArr_2 .cse24)) (.cse208 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse209 (select .cse208 .cse81)) (.cse212 (+ .cse210 1)) (.cse211 (select v_arrayElimArr_2 .cse21)) (.cse214 (+ (select v_arrayElimArr_2 .cse74) 1)) (.cse213 (select .cse208 .cse80))) (or (not (= 2 (select .cse208 .cse77))) (= (+ c_~s~0 .cse209 .cse210) (+ .cse14 (* .cse211 2) 1 (* (select v_arrayElimArr_2 .cse17) 2))) (not (= .cse209 (+ .cse211 1))) (< 0 .cse212) (< .cse212 .cse213) (not (= .cse211 (select v_arrayElimArr_2 .cse16))) (not (= (select .cse208 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< 0 .cse214) (< .cse214 .cse213))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse36))) (or .cse73 (and (forall ((v_~q1_back~0_178 Int)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse217 (select v_arrayElimArr_2 .cse24)) (.cse215 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse216 (select .cse215 .cse81)) (.cse218 (+ .cse217 1)) (.cse220 (+ (select v_arrayElimArr_2 .cse74) 1)) (.cse219 (select .cse215 .cse80))) (or (not (= 2 (select .cse215 .cse77))) (= (+ c_~s~0 .cse216 .cse217) (+ .cse14 (* (select v_arrayElimArr_2 .cse16) 2) 1 (* (select v_arrayElimArr_2 .cse17) 2))) (not (= .cse216 (+ (select v_arrayElimArr_2 .cse21) 1))) (< 0 .cse218) (< .cse218 .cse219) (not (= (select .cse215 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< 0 .cse220) (< .cse220 .cse219))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse36))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse223 (select v_arrayElimArr_2 .cse24)) (.cse221 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse222 (select .cse221 .cse81)) (.cse224 (+ .cse223 1)) (.cse225 (select .cse221 .cse80))) (or (not (= 2 (select .cse221 .cse77))) (= (+ c_~s~0 .cse222 .cse223) (+ .cse14 (* (select v_arrayElimArr_2 .cse16) 2) 1 (* (select v_arrayElimArr_2 .cse17) 2))) (not (= .cse222 (+ (select v_arrayElimArr_2 .cse21) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse224) (< .cse224 .cse225) (not (= (select .cse221 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36) (< (+ (select v_arrayElimArr_2 .cse74) 1) .cse225))))) .cse126))) (or (and (or .cse73 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse229 (select v_arrayElimArr_2 .cse24)) (.cse228 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse227 (select .cse228 .cse81)) (.cse230 (+ .cse229 1)) (.cse226 (+ (select v_arrayElimArr_2 .cse74) 1)) (.cse231 (select .cse228 .cse80))) (or (not (= .cse226 .cse227)) (not (= 2 (select .cse228 .cse77))) (= (+ c_~s~0 .cse227 .cse229) (+ .cse14 (* (select v_arrayElimArr_2 .cse16) 2) 1 (* (select v_arrayElimArr_2 .cse17) 2))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse230) (< .cse230 .cse231) (not (= (select .cse228 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36) (< .cse226 .cse231)))))) (or .cse87 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse235 (select v_arrayElimArr_2 .cse74)) (.cse236 (select v_arrayElimArr_2 .cse24)) (.cse234 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse233 (select .cse234 .cse81)) (.cse237 (+ .cse236 1)) (.cse232 (+ .cse235 1)) (.cse238 (select .cse234 .cse80))) (or (not (= .cse232 .cse233)) (not (= 2 (select .cse234 .cse77))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse14 (* 2 .cse235) (* (select v_arrayElimArr_2 .cse16) 2) 1) (+ c_~s~0 .cse233 .cse236)) (< 0 .cse237) (< .cse237 .cse238) (not (= (select .cse234 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse36) (< .cse232 .cse238))))))) .cse88) (or .cse87 (and (or .cse176 .cse126) (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse241 (select v_arrayElimArr_2 .cse74)) (.cse242 (select v_arrayElimArr_2 .cse24)) (.cse239 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse240 (select .cse239 .cse81)) (.cse243 (+ .cse242 1)) (.cse245 (+ .cse241 1)) (.cse244 (select .cse239 .cse80))) (or (not (= 2 (select .cse239 .cse77))) (not (= .cse240 (+ (select v_arrayElimArr_2 .cse21) 1))) (= (+ .cse14 (* 2 .cse241) (* (select v_arrayElimArr_2 .cse16) 2) 1) (+ c_~s~0 .cse240 .cse242)) (< 0 .cse243) (< .cse243 .cse244) (not (= (select .cse239 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< 0 .cse245) (< .cse245 .cse244))))) (< v_~q1_back~0_178 .cse36)))))))))))))) is different from true [2024-11-09 06:16:16,587 WARN L286 SmtUtils]: Spent 13.28s on a formula simplification. DAG size of input: 521 DAG size of output: 923 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:16:18,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:16:24,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:16:48,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:16:51,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:16:53,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:16:55,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:17:08,736 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 499 DAG size of output: 987 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:17:25,663 WARN L286 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 494 DAG size of output: 971 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:17:36,126 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 498 DAG size of output: 986 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:17:38,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:17:47,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:17:50,063 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~q1_front~0 4))) (let ((.cse21 (* c_~q2_back~0 4)) (.cse63 (* c_~q1_back~0 4)) (.cse22 (* c_~q2_front~0 4)) (.cse248 (+ c_~q2_back~0 1)) (.cse68 (+ c_~q1_front~0 1)) (.cse75 (+ .cse1 c_~q1~0.offset 4)) (.cse0 (select |c_#memory_int| c_~q1~0.base)) (.cse76 (+ .cse1 c_~q1~0.offset))) (let ((.cse14 (select .cse0 .cse76)) (.cse18 (select .cse0 .cse75)) (.cse64 (= c_~q2_front~0 0)) (.cse25 (not (= c_~q2_back~0 0))) (.cse65 (= c_~q2_front~0 c_~q2_back~0)) (.cse2 (< c_~n1~0 .cse68)) (.cse4 (< c_~q2_back~0 0)) (.cse5 (< c_~q1_front~0 0)) (.cse67 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse8 (< c_~q1_back~0 0)) (.cse15 (= .cse248 c_~n2~0)) (.cse17 (< c_~n2~0 .cse248)) (.cse12 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ .cse63 c_~q1~0.offset)) (.cse16 (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (* c_~t~0 2)) (.cse11 (+ .cse22 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ c_~q1_back~0 1)) (.cse19 (+ .cse21 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (= c_~q2~0.offset 0) (= (select .cse0 (+ .cse1 (- 4))) 2) (exists ((v_~q1_back~0_177 Int)) (and (<= c_~q1_front~0 v_~q1_back~0_177) (<= v_~q1_back~0_177 1) (= (select .cse0 (* v_~q1_back~0_177 4)) 0))) (= c_~q1~0.offset 0) (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse10 .cse19))) (let ((.cse3 (+ .cse13 1))) (or .cse2 (< 0 .cse3) .cse4 .cse5 (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (not (= (select .cse0 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6))) (not (= (select .cse0 .cse7) 2)) .cse8 (= (+ .cse9 (* (select .cse10 .cse11) 2) (* (select .cse10 .cse12) 2) 1) (+ c_~s~0 .cse13 .cse14)) .cse15 (not (= (+ (select .cse10 .cse16) 1) .cse14)) .cse17 (< .cse3 .cse18))))) (let ((.cse20 (select |c_#memory_int| c_~q2~0.base))) (let ((.cse23 (select .cse20 (+ .cse21 c_~q2~0.offset 4)))) (let ((.cse24 (+ .cse23 1))) (or (not (= .cse14 (+ (select .cse20 (+ .cse21 c_~q2~0.offset)) 1))) .cse2 .cse4 .cse5 (= (+ .cse9 (* (select .cse20 (+ c_~q2~0.offset .cse22)) 2) (* 2 (select .cse20 (+ c_~q2~0.offset .cse22 4))) 1) (+ c_~s~0 .cse23 .cse14)) (< .cse24 .cse18) .cse15 .cse17 (< 0 .cse24))))) (<= 1 c_~q1_front~0) (or .cse2 .cse5 .cse8 .cse25 (let ((.cse35 (not .cse64)) (.cse26 (= c_~q2_front~0 1)) (.cse32 (+ .cse22 4)) (.cse29 (+ .cse1 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse33 (+ .cse63 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse34 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse26 (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((v_subst_78 Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| v_subst_78 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse31 (select v_arrayElimArr_2 4))) (let ((.cse27 (+ .cse31 1)) (.cse30 (select .cse28 .cse34))) (or (< .cse27 (select .cse28 .cse29)) (not (= (select .cse28 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (< 0 .cse27) (= (+ c_~s~0 .cse30 .cse31) (+ .cse9 (* 2 (select v_arrayElimArr_2 .cse32)) 1 (* (select v_arrayElimArr_2 .cse22) 2))) (not (= (+ (select v_arrayElimArr_2 0) 1) .cse30)) (not (= 2 (select .cse28 .cse33))))))) (< v_~q1_back~0_178 .cse6)))) (or .cse35 (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_64 Int)) (let ((.cse39 (select v_arrayElimArr_2 4)) (.cse36 (select (store |c_#memory_int| v_subst_64 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse37 (select .cse36 .cse34)) (.cse38 (select v_arrayElimArr_2 0)) (.cse40 (+ .cse39 1))) (or (not (= (select .cse36 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (= (+ c_~s~0 .cse37) (+ .cse9 (* 2 .cse38) .cse39 1)) (not (= (select .cse36 .cse33) 2)) (not (= .cse37 (+ .cse38 1))) (< .cse40 (select .cse36 .cse29)) (< 0 .cse40))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse6)))) (or .cse35 (forall ((v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int) (v_subst_54 Int)) (let ((.cse43 (select v_arrayElimArr_2 4)) (.cse42 (select (store |c_#memory_int| v_subst_54 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse41 (select .cse42 .cse34)) (.cse44 (+ .cse43 1))) (or (not (= (+ (select v_arrayElimArr_2 0) 1) .cse41)) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (not (= (select .cse42 .cse33) 2)) (= (+ c_~s~0 1) (+ .cse9 .cse41 .cse43)) (< .cse44 (select .cse42 .cse29)) (< 0 .cse44) (< v_~q1_back~0_178 .cse6) (not (= (select .cse42 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0))))))) (or (not .cse26) (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_66 Int)) (let ((.cse48 (select (store |c_#memory_int| v_subst_66 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse46 (select v_arrayElimArr_2 4))) (let ((.cse47 (+ .cse46 1)) (.cse45 (select .cse48 .cse34))) (or (= (+ c_~s~0 .cse45) (+ .cse9 (* 2 (select v_arrayElimArr_2 8)) .cse46 1)) (< .cse47 (select .cse48 .cse29)) (not (= (select .cse48 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (< 0 .cse47) (not (= (select .cse48 .cse33) 2)) (not (= (+ (select v_arrayElimArr_2 0) 1) .cse45)))))) (< v_~q1_back~0_178 .cse6)))) (or .cse26 (and (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse53 (select v_arrayElimArr_2 4))) (let ((.cse51 (+ .cse53 1))) (or (forall ((v_subst_52 Int)) (let ((.cse49 (select (store |c_#memory_int| v_subst_52 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse50 (select .cse49 .cse34)) (.cse52 (* 2 (select v_arrayElimArr_2 .cse32)))) (or (not (= 2 (select .cse49 .cse33))) (not (= (select .cse49 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (not (= (+ (select v_arrayElimArr_2 .cse22) 1) .cse50)) (not (= (+ (select v_arrayElimArr_2 0) 1) .cse50)) (< .cse51 (select .cse49 .cse29)) (= (+ c_~s~0 .cse50) (+ .cse9 .cse52 .cse53 1)) (= (+ c_~s~0 .cse53 1) (+ .cse9 .cse50 .cse52)))))) (< 0 .cse51))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse6))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int) (v_subst_53 Int)) (let ((.cse54 (select (store |c_#memory_int| v_subst_53 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse56 (select v_arrayElimArr_2 4))) (let ((.cse55 (+ .cse56 1)) (.cse57 (select .cse54 .cse34))) (or (not (= (select .cse54 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (not (= 2 (select .cse54 .cse33))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< .cse55 (select .cse54 .cse29)) (= (+ c_~s~0 .cse56 1) (+ .cse9 (* 2 (select v_arrayElimArr_2 .cse32)) .cse57)) (not (= (+ (select v_arrayElimArr_2 .cse22) 1) .cse57)) (< 0 .cse55) (< v_~q1_back~0_178 .cse6) (not (= (+ (select v_arrayElimArr_2 0) 1) .cse57)))))))) (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_63 Int)) (let ((.cse60 (select (store |c_#memory_int| v_subst_63 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse62 (select v_arrayElimArr_2 4))) (let ((.cse61 (+ .cse62 1)) (.cse58 (select v_arrayElimArr_2 0)) (.cse59 (select .cse60 .cse34))) (or (not (= .cse58 (select v_arrayElimArr_2 .cse32))) (not (= (+ .cse58 1) .cse59)) (not (= (select .cse60 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (< .cse61 (select .cse60 .cse29)) (not (= 2 (select .cse60 .cse33))) (< 0 .cse61) (= (+ .cse9 (* 2 .cse58) 1 (* (select v_arrayElimArr_2 .cse22) 2)) (+ c_~s~0 .cse59 .cse62)))))) (< v_~q1_back~0_178 .cse6)))))) (or (and (<= .cse9 c_~s~0) (= (select .cse0 .cse1) 0) (<= (+ c_~s~0 (* |c_thread3Thread1of1ForFork1_~k~0#1| 2)) (+ .cse9 2))) .cse17) (= c_~s~0 0) (<= c_~n2~0 2) .cse65 (or .cse2 (let ((.cse66 (< c_~n1~0 (+ c_~q1_back~0 2)))) (and (or (= c_~s~0 .cse9) .cse66) (or .cse66 (= c_~q1_back~0 c_~q1_front~0)) (or .cse66 .cse64) (or (< c_~n1~0 (+ 3 c_~q1_front~0)) .cse66))) .cse5 .cse67 .cse8 .cse25 (= c_~q1_back~0 .cse68)) (or .cse65 .cse17) (= 2 |c_thread2Thread1of1ForFork0_~j~0#1|) (= c_~t~0 0) (or .cse2 .cse4 .cse5 .cse67 .cse8 .cse15 .cse17 (let ((.cse247 (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (let ((.cse70 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse69 (= c_~q2_front~0 .cse247)) (.cse120 (= c_~q2_back~0 .cse247))) (let ((.cse97 (not (= c_~q2_front~0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (.cse83 (not .cse120)) (.cse82 (not .cse69)) (.cse171 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse244 (select v_arrayElimArr_2 .cse19)) (.cse241 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse242 (select .cse241 .cse76)) (.cse245 (+ .cse244 1)) (.cse243 (select v_arrayElimArr_2 .cse70)) (.cse246 (select .cse241 .cse75))) (or (not (= 2 (select .cse241 .cse7))) (not (= .cse242 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse9 (* 2 .cse243) (* (select v_arrayElimArr_2 .cse11) 2) 1) (+ c_~s~0 .cse242 .cse244)) (< 0 .cse245) (< .cse245 .cse246) (not (= (select .cse241 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6) (< (+ .cse243 1) .cse246)))))) (.cse121 (= c_~q2_back~0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (or (and (or (and (or .cse69 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse73 (select v_arrayElimArr_2 .cse19)) (.cse72 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse71 (select .cse72 .cse76)) (.cse74 (+ .cse73 1))) (or (not (= (+ (select v_arrayElimArr_2 .cse70) 1) .cse71)) (not (= 2 (select .cse72 .cse7))) (= (+ c_~s~0 .cse71 .cse73) (+ .cse9 (* (select v_arrayElimArr_2 .cse11) 2) 1 (* (select v_arrayElimArr_2 .cse12) 2))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse74) (< .cse74 (select .cse72 .cse75)) (not (= (select .cse72 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6)))))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse80 (select v_arrayElimArr_2 .cse19)) (.cse79 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse77 (select v_arrayElimArr_2 .cse70)) (.cse78 (select .cse79 .cse76)) (.cse81 (+ .cse80 1))) (or (not (= (+ .cse77 1) .cse78)) (not (= 2 (select .cse79 .cse7))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse9 (* 2 .cse77) (* (select v_arrayElimArr_2 .cse11) 2) 1) (+ c_~s~0 .cse78 .cse80)) (< 0 .cse81) (< .cse81 (select .cse79 .cse75)) (not (= (select .cse79 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6))))) .cse82)) .cse83) (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse86 (select v_arrayElimArr_2 .cse19))) (let ((.cse88 (+ .cse86 1)) (.cse87 (select v_arrayElimArr_2 .cse16))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (let ((.cse84 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse85 (select .cse84 .cse76))) (or (not (= 2 (select .cse84 .cse7))) (= (+ c_~s~0 .cse85 .cse86) (+ .cse9 (* .cse87 2) 1 (* (select v_arrayElimArr_2 .cse12) 2))) (not (= .cse85 (+ .cse87 1))) (< .cse88 (select .cse84 .cse75)) (not (= (select .cse84 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)))))) (< 0 .cse88) (not (= .cse87 (select v_arrayElimArr_2 .cse11))))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse6))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse91 (select v_arrayElimArr_2 .cse19)) (.cse89 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse90 (select .cse89 .cse76)) (.cse92 (+ .cse91 1))) (or (not (= 2 (select .cse89 .cse7))) (not (= .cse90 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse9 (* 2 (select v_arrayElimArr_2 .cse70)) (* (select v_arrayElimArr_2 .cse11) 2) 1) (+ c_~s~0 .cse90 .cse91)) (< 0 .cse92) (< .cse92 (select .cse89 .cse75)) (not (= (select .cse89 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6))))) .cse82) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse95 (select v_arrayElimArr_2 .cse19)) (.cse93 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse94 (select .cse93 .cse76)) (.cse96 (+ .cse95 1))) (or (not (= 2 (select .cse93 .cse7))) (= (+ c_~s~0 .cse94 .cse95) (+ .cse9 (* (select v_arrayElimArr_2 .cse11) 2) 1 (* (select v_arrayElimArr_2 .cse12) 2))) (not (= .cse94 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse96) (< .cse96 (select .cse93 .cse75)) (not (= (select .cse93 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6))))) .cse69) (or .cse97 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse100 (select v_arrayElimArr_2 .cse19)) (.cse98 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse99 (select .cse98 .cse76)) (.cse101 (+ .cse100 1))) (or (not (= 2 (select .cse98 .cse7))) (not (= .cse99 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse99 .cse100) (+ .cse9 (* 2 (select v_arrayElimArr_2 .cse70)) 1 (* (select v_arrayElimArr_2 .cse12) 2))) (< 0 .cse101) (< .cse101 (select .cse98 .cse75)) (not (= (select .cse98 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6)))))) (or (and (or .cse97 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse104 (select v_arrayElimArr_2 .cse19)) (.cse102 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse103 (select .cse102 .cse76)) (.cse105 (+ .cse104 1))) (or (not (= 2 (select .cse102 .cse7))) (not (= (+ (select v_arrayElimArr_2 .cse12) 1) .cse103)) (not (= .cse103 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse104 1) (+ .cse9 (* 2 (select v_arrayElimArr_2 .cse70)) .cse103)) (< 0 .cse105) (< .cse105 (select .cse102 .cse75)) (not (= (select .cse102 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6)))))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse106 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse109 (select v_arrayElimArr_2 .cse19))) (let ((.cse108 (+ .cse109 1)) (.cse107 (select .cse106 .cse76))) (or (not (= 2 (select .cse106 .cse7))) (not (= (+ (select v_arrayElimArr_2 .cse12) 1) .cse107)) (not (= .cse107 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse108) (< .cse108 (select .cse106 .cse75)) (not (= (select .cse106 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse9 (* (select v_arrayElimArr_2 .cse11) 2) .cse107) (+ c_~s~0 .cse109 1)) (< v_~q1_back~0_178 .cse6))))) .cse69) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse110 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse113 (select v_arrayElimArr_2 .cse19))) (let ((.cse114 (+ .cse113 1)) (.cse112 (* (select v_arrayElimArr_2 .cse11) 2)) (.cse111 (select .cse110 .cse76))) (or (not (= 2 (select .cse110 .cse7))) (not (= .cse111 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse9 (* 2 (select v_arrayElimArr_2 .cse70)) .cse112 1) (+ c_~s~0 .cse111 .cse113)) (< 0 .cse114) (< .cse114 (select .cse110 .cse75)) (not (= (select .cse110 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse9 .cse112 .cse111) (+ c_~s~0 .cse113 1)) (< v_~q1_back~0_178 .cse6))))) .cse82) (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse118 (select v_arrayElimArr_2 .cse19))) (let ((.cse119 (+ .cse118 1))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (let ((.cse115 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse117 (* (select v_arrayElimArr_2 .cse11) 2)) (.cse116 (select .cse115 .cse76))) (or (not (= 2 (select .cse115 .cse7))) (not (= (+ (select v_arrayElimArr_2 .cse12) 1) .cse116)) (not (= .cse116 (+ (select v_arrayElimArr_2 .cse16) 1))) (= (+ .cse9 (* 2 (select v_arrayElimArr_2 .cse70)) .cse117 1) (+ c_~s~0 .cse116 .cse118)) (< .cse119 (select .cse115 .cse75)) (not (= (select .cse115 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse9 .cse117 .cse116) (+ c_~s~0 .cse118 1)))))) (< 0 .cse119))))) (< v_~q1_back~0_178 .cse6)))) .cse120)) .cse121) (or (and (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse125 (select v_arrayElimArr_2 .cse70)) (.cse124 (select v_arrayElimArr_2 .cse19)) (.cse122 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse123 (select .cse122 .cse76)) (.cse126 (+ .cse124 1)) (.cse128 (+ .cse125 1)) (.cse127 (select .cse122 .cse75))) (or (not (= 2 (select .cse122 .cse7))) (not (= (+ (select v_arrayElimArr_2 .cse12) 1) .cse123)) (not (= .cse123 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse124 1) (+ .cse9 (* 2 .cse125) .cse123)) (< 0 .cse126) (< .cse126 .cse127) (not (= (select .cse122 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6) (< 0 .cse128) (< .cse128 .cse127))))) .cse97) (or (and (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse131 (select v_arrayElimArr_2 .cse70)) (.cse133 (select v_arrayElimArr_2 .cse19))) (let ((.cse134 (+ .cse133 1)) (.cse136 (+ .cse131 1))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (let ((.cse129 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse132 (* (select v_arrayElimArr_2 .cse11) 2)) (.cse130 (select .cse129 .cse76)) (.cse135 (select .cse129 .cse75))) (or (not (= 2 (select .cse129 .cse7))) (not (= (+ (select v_arrayElimArr_2 .cse12) 1) .cse130)) (not (= .cse130 (+ (select v_arrayElimArr_2 .cse16) 1))) (= (+ .cse9 (* 2 .cse131) .cse132 1) (+ c_~s~0 .cse130 .cse133)) (< .cse134 .cse135) (not (= (select .cse129 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse9 .cse132 .cse130) (+ c_~s~0 .cse133 1)) (< .cse136 .cse135))))) (< 0 .cse134) (< 0 .cse136))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse6))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse139 (select v_arrayElimArr_2 .cse70)) (.cse137 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse141 (select v_arrayElimArr_2 .cse19))) (let ((.cse142 (+ .cse141 1)) (.cse140 (* (select v_arrayElimArr_2 .cse11) 2)) (.cse138 (select .cse137 .cse76)) (.cse144 (+ .cse139 1)) (.cse143 (select .cse137 .cse75))) (or (not (= 2 (select .cse137 .cse7))) (not (= .cse138 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse9 (* 2 .cse139) .cse140 1) (+ c_~s~0 .cse138 .cse141)) (< 0 .cse142) (< .cse142 .cse143) (not (= (select .cse137 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse9 .cse140 .cse138) (+ c_~s~0 .cse141 1)) (< v_~q1_back~0_178 .cse6) (< 0 .cse144) (< .cse144 .cse143))))) .cse82) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse147 (select v_arrayElimArr_2 .cse70)) (.cse148 (select v_arrayElimArr_2 .cse19)) (.cse145 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse146 (select .cse145 .cse76)) (.cse149 (+ .cse148 1)) (.cse151 (+ .cse147 1)) (.cse150 (select .cse145 .cse75))) (or (not (= 2 (select .cse145 .cse7))) (not (= .cse146 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse9 (* 2 .cse147) (* (select v_arrayElimArr_2 .cse11) 2) 1) (+ c_~s~0 .cse146 .cse148)) (< 0 .cse149) (< .cse149 .cse150) (not (= (select .cse145 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6) (< 0 .cse151) (< .cse151 .cse150))))) .cse82) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse152 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse156 (select v_arrayElimArr_2 .cse19))) (let ((.cse154 (+ .cse156 1)) (.cse153 (select .cse152 .cse76)) (.cse157 (+ (select v_arrayElimArr_2 .cse70) 1)) (.cse155 (select .cse152 .cse75))) (or (not (= 2 (select .cse152 .cse7))) (not (= (+ (select v_arrayElimArr_2 .cse12) 1) .cse153)) (not (= .cse153 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse154) (< .cse154 .cse155) (not (= (select .cse152 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse9 (* (select v_arrayElimArr_2 .cse11) 2) .cse153) (+ c_~s~0 .cse156 1)) (< v_~q1_back~0_178 .cse6) (< 0 .cse157) (< .cse157 .cse155))))) .cse69)) (and .cse121 .cse69)) (or .cse121 (and (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse160 (select v_arrayElimArr_2 .cse19)) (.cse158 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse159 (select .cse158 .cse76)) (.cse162 (+ .cse160 1)) (.cse161 (select v_arrayElimArr_2 .cse70)) (.cse163 (select .cse158 .cse75))) (or (not (= 2 (select .cse158 .cse7))) (not (= (+ (select v_arrayElimArr_2 .cse12) 1) .cse159)) (not (= .cse159 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse160 1) (+ .cse9 (* 2 .cse161) .cse159)) (< 0 .cse162) (< .cse162 .cse163) (not (= (select .cse158 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6) (< (+ .cse161 1) .cse163))))) .cse97) (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse168 (select v_arrayElimArr_2 .cse19))) (let ((.cse169 (+ .cse168 1))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (let ((.cse164 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse167 (* (select v_arrayElimArr_2 .cse11) 2)) (.cse165 (select .cse164 .cse76)) (.cse166 (select v_arrayElimArr_2 .cse70)) (.cse170 (select .cse164 .cse75))) (or (not (= 2 (select .cse164 .cse7))) (not (= (+ (select v_arrayElimArr_2 .cse12) 1) .cse165)) (not (= .cse165 (+ (select v_arrayElimArr_2 .cse16) 1))) (= (+ .cse9 (* 2 .cse166) .cse167 1) (+ c_~s~0 .cse165 .cse168)) (< .cse169 .cse170) (not (= (select .cse164 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse9 .cse167 .cse165) (+ c_~s~0 .cse168 1)) (< (+ .cse166 1) .cse170))))) (< 0 .cse169))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse6))) (or .cse171 .cse82) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse172 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse176 (select v_arrayElimArr_2 .cse19))) (let ((.cse177 (+ .cse176 1)) (.cse175 (* (select v_arrayElimArr_2 .cse11) 2)) (.cse173 (select .cse172 .cse76)) (.cse174 (select v_arrayElimArr_2 .cse70)) (.cse178 (select .cse172 .cse75))) (or (not (= 2 (select .cse172 .cse7))) (not (= .cse173 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse9 (* 2 .cse174) .cse175 1) (+ c_~s~0 .cse173 .cse176)) (< 0 .cse177) (< .cse177 .cse178) (not (= (select .cse172 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse9 .cse175 .cse173) (+ c_~s~0 .cse176 1)) (< v_~q1_back~0_178 .cse6) (< (+ .cse174 1) .cse178))))) .cse82) (or .cse69 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse179 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse183 (select v_arrayElimArr_2 .cse19))) (let ((.cse181 (+ .cse183 1)) (.cse180 (select .cse179 .cse76)) (.cse182 (select .cse179 .cse75))) (or (not (= 2 (select .cse179 .cse7))) (not (= (+ (select v_arrayElimArr_2 .cse12) 1) .cse180)) (not (= .cse180 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse181) (< .cse181 .cse182) (not (= (select .cse179 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse9 (* (select v_arrayElimArr_2 .cse11) 2) .cse180) (+ c_~s~0 .cse183 1)) (< v_~q1_back~0_178 .cse6) (< (+ (select v_arrayElimArr_2 .cse70) 1) .cse182))))))))) .cse120) (or .cse121 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse186 (select v_arrayElimArr_2 .cse19)) (.cse184 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse185 (select .cse184 .cse76)) (.cse188 (+ .cse186 1)) (.cse187 (select v_arrayElimArr_2 .cse16)) (.cse189 (select .cse184 .cse75))) (or (not (= 2 (select .cse184 .cse7))) (= (+ c_~s~0 .cse185 .cse186) (+ .cse9 (* .cse187 2) 1 (* (select v_arrayElimArr_2 .cse12) 2))) (not (= .cse185 (+ .cse187 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse188) (< .cse188 .cse189) (not (= .cse187 (select v_arrayElimArr_2 .cse11))) (not (= (select .cse184 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6) (< (+ (select v_arrayElimArr_2 .cse70) 1) .cse189)))))) (or (and (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse193 (select v_arrayElimArr_2 .cse70)) (.cse192 (select v_arrayElimArr_2 .cse19)) (.cse190 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse191 (select .cse190 .cse76)) (.cse194 (+ .cse192 1)) (.cse196 (+ .cse193 1)) (.cse195 (select .cse190 .cse75))) (or (not (= 2 (select .cse190 .cse7))) (not (= .cse191 (+ (select v_arrayElimArr_2 .cse16) 1))) (= (+ c_~s~0 .cse191 .cse192) (+ .cse9 (* 2 .cse193) 1 (* (select v_arrayElimArr_2 .cse12) 2))) (< 0 .cse194) (< .cse194 .cse195) (not (= (select .cse190 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< 0 .cse196) (< .cse196 .cse195))))) (< v_~q1_back~0_178 .cse6))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse199 (select v_arrayElimArr_2 .cse19)) (.cse197 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse198 (select .cse197 .cse76)) (.cse201 (+ .cse199 1)) (.cse200 (select v_arrayElimArr_2 .cse70)) (.cse202 (select .cse197 .cse75))) (or (not (= 2 (select .cse197 .cse7))) (not (= .cse198 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse198 .cse199) (+ .cse9 (* 2 .cse200) 1 (* (select v_arrayElimArr_2 .cse12) 2))) (< 0 .cse201) (< .cse201 .cse202) (not (= (select .cse197 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6) (< (+ .cse200 1) .cse202))))) .cse121)) .cse97) (forall ((v_~q1_back~0_178 Int)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse205 (select v_arrayElimArr_2 .cse19)) (.cse203 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse204 (select .cse203 .cse76)) (.cse207 (+ .cse205 1)) (.cse206 (select v_arrayElimArr_2 .cse16)) (.cse209 (+ (select v_arrayElimArr_2 .cse70) 1)) (.cse208 (select .cse203 .cse75))) (or (not (= 2 (select .cse203 .cse7))) (= (+ c_~s~0 .cse204 .cse205) (+ .cse9 (* .cse206 2) 1 (* (select v_arrayElimArr_2 .cse12) 2))) (not (= .cse204 (+ .cse206 1))) (< 0 .cse207) (< .cse207 .cse208) (not (= .cse206 (select v_arrayElimArr_2 .cse11))) (not (= (select .cse203 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< 0 .cse209) (< .cse209 .cse208))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse6))) (or .cse69 (and (forall ((v_~q1_back~0_178 Int)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse212 (select v_arrayElimArr_2 .cse19)) (.cse210 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse211 (select .cse210 .cse76)) (.cse213 (+ .cse212 1)) (.cse215 (+ (select v_arrayElimArr_2 .cse70) 1)) (.cse214 (select .cse210 .cse75))) (or (not (= 2 (select .cse210 .cse7))) (= (+ c_~s~0 .cse211 .cse212) (+ .cse9 (* (select v_arrayElimArr_2 .cse11) 2) 1 (* (select v_arrayElimArr_2 .cse12) 2))) (not (= .cse211 (+ (select v_arrayElimArr_2 .cse16) 1))) (< 0 .cse213) (< .cse213 .cse214) (not (= (select .cse210 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< 0 .cse215) (< .cse215 .cse214))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse6))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse218 (select v_arrayElimArr_2 .cse19)) (.cse216 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse217 (select .cse216 .cse76)) (.cse219 (+ .cse218 1)) (.cse220 (select .cse216 .cse75))) (or (not (= 2 (select .cse216 .cse7))) (= (+ c_~s~0 .cse217 .cse218) (+ .cse9 (* (select v_arrayElimArr_2 .cse11) 2) 1 (* (select v_arrayElimArr_2 .cse12) 2))) (not (= .cse217 (+ (select v_arrayElimArr_2 .cse16) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse219) (< .cse219 .cse220) (not (= (select .cse216 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6) (< (+ (select v_arrayElimArr_2 .cse70) 1) .cse220))))) .cse121))) (or (and (or .cse69 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse224 (select v_arrayElimArr_2 .cse19)) (.cse223 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse222 (select .cse223 .cse76)) (.cse225 (+ .cse224 1)) (.cse221 (+ (select v_arrayElimArr_2 .cse70) 1)) (.cse226 (select .cse223 .cse75))) (or (not (= .cse221 .cse222)) (not (= 2 (select .cse223 .cse7))) (= (+ c_~s~0 .cse222 .cse224) (+ .cse9 (* (select v_arrayElimArr_2 .cse11) 2) 1 (* (select v_arrayElimArr_2 .cse12) 2))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse225) (< .cse225 .cse226) (not (= (select .cse223 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6) (< .cse221 .cse226)))))) (or .cse82 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse230 (select v_arrayElimArr_2 .cse70)) (.cse231 (select v_arrayElimArr_2 .cse19)) (.cse229 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse228 (select .cse229 .cse76)) (.cse232 (+ .cse231 1)) (.cse227 (+ .cse230 1)) (.cse233 (select .cse229 .cse75))) (or (not (= .cse227 .cse228)) (not (= 2 (select .cse229 .cse7))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse9 (* 2 .cse230) (* (select v_arrayElimArr_2 .cse11) 2) 1) (+ c_~s~0 .cse228 .cse231)) (< 0 .cse232) (< .cse232 .cse233) (not (= (select .cse229 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse6) (< .cse227 .cse233))))))) .cse83) (or .cse82 (and (or .cse171 .cse121) (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse236 (select v_arrayElimArr_2 .cse70)) (.cse237 (select v_arrayElimArr_2 .cse19)) (.cse234 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse235 (select .cse234 .cse76)) (.cse238 (+ .cse237 1)) (.cse240 (+ .cse236 1)) (.cse239 (select .cse234 .cse75))) (or (not (= 2 (select .cse234 .cse7))) (not (= .cse235 (+ (select v_arrayElimArr_2 .cse16) 1))) (= (+ .cse9 (* 2 .cse236) (* (select v_arrayElimArr_2 .cse11) 2) 1) (+ c_~s~0 .cse235 .cse237)) (< 0 .cse238) (< .cse238 .cse239) (not (= (select .cse234 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< 0 .cse240) (< .cse240 .cse239))))) (< v_~q1_back~0_178 .cse6)))))))))))))) is different from true [2024-11-09 06:17:51,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:17:53,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:17:58,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:18:39,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:18:41,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:18:45,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:18:46,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:18:56,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:18:58,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:19:02,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:19:06,757 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse81 (select |c_#memory_int| c_~q2~0.base)) (.cse266 (* c_~q2_back~0 4)) (.cse74 (* c_~q1_front~0 4))) (let ((.cse12 (select |c_#memory_int| c_~q1~0.base)) (.cse93 (+ .cse74 c_~q1~0.offset)) (.cse82 (select .cse81 (+ .cse266 c_~q2~0.offset))) (.cse43 (* c_~q2_front~0 4)) (.cse30 (select .cse81 (+ .cse266 c_~q2~0.offset 4)))) (let ((.cse31 (+ .cse30 1)) (.cse4 (* c_~t~0 2)) (.cse6 (* (select .cse81 (+ c_~q2~0.offset .cse43)) 2)) (.cse265 (+ c_~q2_back~0 1)) (.cse28 (+ .cse82 1)) (.cse20 (select .cse12 .cse93)) (.cse75 (* c_~q1_back~0 4)) (.cse85 (+ c_~q1_front~0 1)) (.cse5 (* |c_thread3Thread1of1ForFork1_~k~0#1| 2)) (.cse92 (+ .cse74 c_~q1~0.offset 4))) (let ((.cse23 (select .cse12 .cse92)) (.cse35 (= c_~q2_front~0 1)) (.cse0 (= c_~q2~0.offset 0)) (.cse27 (= |c_thread2Thread1of1ForFork0_~j~0#1| 0)) (.cse77 (+ c_~s~0 .cse5)) (.cse76 (= c_~q2_front~0 0)) (.cse36 (not (= c_~q2_back~0 0))) (.cse78 (* (select .cse81 .cse43) 2)) (.cse9 (< c_~n1~0 .cse85)) (.cse11 (< c_~q1_front~0 0)) (.cse84 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse15 (< c_~q1_back~0 0)) (.cse18 (+ .cse43 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (+ .cse75 c_~q1~0.offset)) (.cse22 (+ .cse266 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (+ .cse43 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse13 (+ c_~q1_back~0 1)) (.cse24 (+ .cse266 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse79 (select .cse81 4)) (.cse3 (+ c_~s~0 .cse82)) (.cse2 (< .cse28 .cse20)) (.cse8 (< 0 .cse28)) (.cse1 (< c_~q2_back~0 0)) (.cse21 (= .cse265 c_~n2~0)) (.cse7 (< c_~n2~0 .cse265)) (.cse80 (not (= |c_thread2Thread1of1ForFork0_~j~0#1| .cse28))) (.cse29 (+ .cse4 .cse6 (* 2 (select .cse81 (+ c_~q2~0.offset .cse43 4))) 1)) (.cse32 (< 0 .cse31))) (and .cse0 (or .cse1 .cse2 (= .cse3 (+ .cse4 .cse5 .cse6 1)) .cse7 .cse8) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse19 (select .cse16 .cse24))) (let ((.cse10 (+ .cse19 1))) (or .cse9 (< 0 .cse10) .cse1 .cse11 (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (not (= (select .cse12 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13))) (not (= (select .cse12 .cse14) 2)) .cse15 (= (+ .cse4 (* (select .cse16 .cse17) 2) (* (select .cse16 .cse18) 2) 1) (+ c_~s~0 .cse19 .cse20)) .cse21 (not (= (+ (select .cse16 .cse22) 1) .cse20)) .cse7 (< .cse10 .cse23))))) (exists ((v_~q1_front~0_122 Int) (~q1~0.base Int) (v_~q1_back~0_177 Int)) (let ((.cse25 (select |c_#memory_int| ~q1~0.base)) (.cse26 (* v_~q1_front~0_122 4))) (and (<= 1 v_~q1_front~0_122) (<= v_~q1_front~0_122 v_~q1_back~0_177) (= (select .cse25 (* v_~q1_back~0_177 4)) 0) (<= v_~q1_back~0_177 1) (<= (+ 2 (select .cse25 .cse26)) c_~s~0) (= 2 (select .cse25 (+ .cse26 (- 4))))))) .cse27 (= c_~t~0 1) (= c_~s~0 2) (or (not (= .cse20 .cse28)) .cse9 .cse1 .cse11 (= .cse29 (+ c_~s~0 .cse30 .cse20)) (< .cse31 .cse23) .cse21 .cse7 .cse32) (exists ((v_~q1_front~0_122 Int) (~q1~0.base Int) (v_~q1_back~0_177 Int)) (let ((.cse33 (select |c_#memory_int| ~q1~0.base)) (.cse34 (* v_~q1_front~0_122 4))) (and (<= 1 v_~q1_front~0_122) (<= v_~q1_front~0_122 v_~q1_back~0_177) (= (select .cse33 (* v_~q1_back~0_177 4)) 0) (<= v_~q1_back~0_177 1) (= 2 (select .cse33 (+ .cse34 (- 4)))) (<= (select .cse33 .cse34) |c_thread2Thread1of1ForFork0_~j~0#1|)))) (<= c_~s~0 2) (= c_~s~0 (+ 2 |c_thread2Thread1of1ForFork0_~j~0#1|)) .cse35 (or .cse9 .cse11 .cse15 .cse36 (let ((.cse46 (not .cse76)) (.cse42 (+ .cse43 4)) (.cse39 (+ .cse74 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse44 (+ .cse75 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse45 (+ .cse74 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse35 (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((v_subst_78 Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| v_subst_78 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse41 (select v_arrayElimArr_2 4))) (let ((.cse37 (+ .cse41 1)) (.cse40 (select .cse38 .cse45))) (or (< .cse37 (select .cse38 .cse39)) (not (= (select .cse38 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (< 0 .cse37) (= (+ c_~s~0 .cse40 .cse41) (+ .cse4 (* 2 (select v_arrayElimArr_2 .cse42)) 1 (* (select v_arrayElimArr_2 .cse43) 2))) (not (= (+ (select v_arrayElimArr_2 0) 1) .cse40)) (not (= 2 (select .cse38 .cse44))))))) (< v_~q1_back~0_178 .cse13)))) (or .cse46 (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_64 Int)) (let ((.cse50 (select v_arrayElimArr_2 4)) (.cse47 (select (store |c_#memory_int| v_subst_64 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse48 (select .cse47 .cse45)) (.cse49 (select v_arrayElimArr_2 0)) (.cse51 (+ .cse50 1))) (or (not (= (select .cse47 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (= (+ c_~s~0 .cse48) (+ .cse4 (* 2 .cse49) .cse50 1)) (not (= (select .cse47 .cse44) 2)) (not (= .cse48 (+ .cse49 1))) (< .cse51 (select .cse47 .cse39)) (< 0 .cse51))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse13)))) (or .cse46 (forall ((v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int) (v_subst_54 Int)) (let ((.cse54 (select v_arrayElimArr_2 4)) (.cse53 (select (store |c_#memory_int| v_subst_54 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse52 (select .cse53 .cse45)) (.cse55 (+ .cse54 1))) (or (not (= (+ (select v_arrayElimArr_2 0) 1) .cse52)) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (not (= (select .cse53 .cse44) 2)) (= (+ c_~s~0 1) (+ .cse4 .cse52 .cse54)) (< .cse55 (select .cse53 .cse39)) (< 0 .cse55) (< v_~q1_back~0_178 .cse13) (not (= (select .cse53 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0))))))) (or (not .cse35) (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_66 Int)) (let ((.cse59 (select (store |c_#memory_int| v_subst_66 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse57 (select v_arrayElimArr_2 4))) (let ((.cse58 (+ .cse57 1)) (.cse56 (select .cse59 .cse45))) (or (= (+ c_~s~0 .cse56) (+ .cse4 (* 2 (select v_arrayElimArr_2 8)) .cse57 1)) (< .cse58 (select .cse59 .cse39)) (not (= (select .cse59 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (< 0 .cse58) (not (= (select .cse59 .cse44) 2)) (not (= (+ (select v_arrayElimArr_2 0) 1) .cse56)))))) (< v_~q1_back~0_178 .cse13)))) (or .cse35 (and (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse64 (select v_arrayElimArr_2 4))) (let ((.cse62 (+ .cse64 1))) (or (forall ((v_subst_52 Int)) (let ((.cse60 (select (store |c_#memory_int| v_subst_52 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse61 (select .cse60 .cse45)) (.cse63 (* 2 (select v_arrayElimArr_2 .cse42)))) (or (not (= 2 (select .cse60 .cse44))) (not (= (select .cse60 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (not (= (+ (select v_arrayElimArr_2 .cse43) 1) .cse61)) (not (= (+ (select v_arrayElimArr_2 0) 1) .cse61)) (< .cse62 (select .cse60 .cse39)) (= (+ c_~s~0 .cse61) (+ .cse4 .cse63 .cse64 1)) (= (+ c_~s~0 .cse64 1) (+ .cse4 .cse61 .cse63)))))) (< 0 .cse62))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse13))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int) (v_subst_53 Int)) (let ((.cse65 (select (store |c_#memory_int| v_subst_53 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse67 (select v_arrayElimArr_2 4))) (let ((.cse66 (+ .cse67 1)) (.cse68 (select .cse65 .cse45))) (or (not (= (select .cse65 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (not (= 2 (select .cse65 .cse44))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< .cse66 (select .cse65 .cse39)) (= (+ c_~s~0 .cse67 1) (+ .cse4 (* 2 (select v_arrayElimArr_2 .cse42)) .cse68)) (not (= (+ (select v_arrayElimArr_2 .cse43) 1) .cse68)) (< 0 .cse66) (< v_~q1_back~0_178 .cse13) (not (= (+ (select v_arrayElimArr_2 0) 1) .cse68)))))))) (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_63 Int)) (let ((.cse71 (select (store |c_#memory_int| v_subst_63 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse73 (select v_arrayElimArr_2 4))) (let ((.cse72 (+ .cse73 1)) (.cse69 (select v_arrayElimArr_2 0)) (.cse70 (select .cse71 .cse45))) (or (not (= .cse69 (select v_arrayElimArr_2 .cse42))) (not (= (+ .cse69 1) .cse70)) (not (= (select .cse71 (+ (* v_~q1_back~0_178 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)) (< .cse72 (select .cse71 .cse39)) (not (= 2 (select .cse71 .cse44))) (< 0 .cse72) (= (+ .cse4 (* 2 .cse69) 1 (* (select v_arrayElimArr_2 .cse43) 2)) (+ c_~s~0 .cse70 .cse73)))))) (< v_~q1_back~0_178 .cse13)))))) (<= .cse77 (+ .cse4 .cse78 4)) (= (+ .cse79 1) |c_thread2Thread1of1ForFork0_~j~0#1|) (or .cse80 (and .cse0 (or (= c_~q2_front~0 c_~q2_back~0) .cse7) (or (and (<= .cse4 c_~s~0) .cse27 (<= .cse77 (+ .cse4 2))) .cse7))) (= (select .cse81 0) 1) (or (= .cse29 (+ c_~s~0 .cse82 |c_thread2Thread1of1ForFork0_~j~0#1|)) .cse1 .cse2 .cse7 .cse8) (or .cse9 (let ((.cse83 (< c_~n1~0 (+ c_~q1_back~0 2)))) (and (or (= c_~s~0 .cse4) .cse83) (or .cse83 (= c_~q1_back~0 c_~q1_front~0)) (or .cse83 .cse76) (or (< c_~n1~0 (+ 3 c_~q1_front~0)) .cse83))) .cse11 .cse84 .cse15 .cse36 (= c_~q1_back~0 .cse85)) (<= (+ .cse4 .cse78 2) c_~s~0) (or .cse1 .cse2 .cse7 .cse8 (= (+ .cse4 .cse6 1) .cse3)) (or .cse9 .cse1 .cse11 .cse84 .cse15 .cse21 .cse7 (let ((.cse264 (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (let ((.cse87 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse86 (= c_~q2_front~0 .cse264)) (.cse137 (= c_~q2_back~0 .cse264))) (let ((.cse114 (not (= c_~q2_front~0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (.cse100 (not .cse137)) (.cse99 (not .cse86)) (.cse188 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse261 (select v_arrayElimArr_2 .cse24)) (.cse258 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse259 (select .cse258 .cse93)) (.cse262 (+ .cse261 1)) (.cse260 (select v_arrayElimArr_2 .cse87)) (.cse263 (select .cse258 .cse92))) (or (not (= 2 (select .cse258 .cse14))) (not (= .cse259 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse4 (* 2 .cse260) (* (select v_arrayElimArr_2 .cse17) 2) 1) (+ c_~s~0 .cse259 .cse261)) (< 0 .cse262) (< .cse262 .cse263) (not (= (select .cse258 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13) (< (+ .cse260 1) .cse263)))))) (.cse138 (= c_~q2_back~0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (or (and (or (and (or .cse86 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse90 (select v_arrayElimArr_2 .cse24)) (.cse89 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse88 (select .cse89 .cse93)) (.cse91 (+ .cse90 1))) (or (not (= (+ (select v_arrayElimArr_2 .cse87) 1) .cse88)) (not (= 2 (select .cse89 .cse14))) (= (+ c_~s~0 .cse88 .cse90) (+ .cse4 (* (select v_arrayElimArr_2 .cse17) 2) 1 (* (select v_arrayElimArr_2 .cse18) 2))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse91) (< .cse91 (select .cse89 .cse92)) (not (= (select .cse89 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13)))))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse97 (select v_arrayElimArr_2 .cse24)) (.cse96 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse94 (select v_arrayElimArr_2 .cse87)) (.cse95 (select .cse96 .cse93)) (.cse98 (+ .cse97 1))) (or (not (= (+ .cse94 1) .cse95)) (not (= 2 (select .cse96 .cse14))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse4 (* 2 .cse94) (* (select v_arrayElimArr_2 .cse17) 2) 1) (+ c_~s~0 .cse95 .cse97)) (< 0 .cse98) (< .cse98 (select .cse96 .cse92)) (not (= (select .cse96 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13))))) .cse99)) .cse100) (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse103 (select v_arrayElimArr_2 .cse24))) (let ((.cse105 (+ .cse103 1)) (.cse104 (select v_arrayElimArr_2 .cse22))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (let ((.cse101 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse102 (select .cse101 .cse93))) (or (not (= 2 (select .cse101 .cse14))) (= (+ c_~s~0 .cse102 .cse103) (+ .cse4 (* .cse104 2) 1 (* (select v_arrayElimArr_2 .cse18) 2))) (not (= .cse102 (+ .cse104 1))) (< .cse105 (select .cse101 .cse92)) (not (= (select .cse101 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)))))) (< 0 .cse105) (not (= .cse104 (select v_arrayElimArr_2 .cse17))))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse13))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse108 (select v_arrayElimArr_2 .cse24)) (.cse106 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse107 (select .cse106 .cse93)) (.cse109 (+ .cse108 1))) (or (not (= 2 (select .cse106 .cse14))) (not (= .cse107 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse4 (* 2 (select v_arrayElimArr_2 .cse87)) (* (select v_arrayElimArr_2 .cse17) 2) 1) (+ c_~s~0 .cse107 .cse108)) (< 0 .cse109) (< .cse109 (select .cse106 .cse92)) (not (= (select .cse106 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13))))) .cse99) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse112 (select v_arrayElimArr_2 .cse24)) (.cse110 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse111 (select .cse110 .cse93)) (.cse113 (+ .cse112 1))) (or (not (= 2 (select .cse110 .cse14))) (= (+ c_~s~0 .cse111 .cse112) (+ .cse4 (* (select v_arrayElimArr_2 .cse17) 2) 1 (* (select v_arrayElimArr_2 .cse18) 2))) (not (= .cse111 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse113) (< .cse113 (select .cse110 .cse92)) (not (= (select .cse110 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13))))) .cse86) (or .cse114 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse117 (select v_arrayElimArr_2 .cse24)) (.cse115 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse116 (select .cse115 .cse93)) (.cse118 (+ .cse117 1))) (or (not (= 2 (select .cse115 .cse14))) (not (= .cse116 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse116 .cse117) (+ .cse4 (* 2 (select v_arrayElimArr_2 .cse87)) 1 (* (select v_arrayElimArr_2 .cse18) 2))) (< 0 .cse118) (< .cse118 (select .cse115 .cse92)) (not (= (select .cse115 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13)))))) (or (and (or .cse114 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse121 (select v_arrayElimArr_2 .cse24)) (.cse119 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse120 (select .cse119 .cse93)) (.cse122 (+ .cse121 1))) (or (not (= 2 (select .cse119 .cse14))) (not (= (+ (select v_arrayElimArr_2 .cse18) 1) .cse120)) (not (= .cse120 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse121 1) (+ .cse4 (* 2 (select v_arrayElimArr_2 .cse87)) .cse120)) (< 0 .cse122) (< .cse122 (select .cse119 .cse92)) (not (= (select .cse119 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13)))))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse123 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse126 (select v_arrayElimArr_2 .cse24))) (let ((.cse125 (+ .cse126 1)) (.cse124 (select .cse123 .cse93))) (or (not (= 2 (select .cse123 .cse14))) (not (= (+ (select v_arrayElimArr_2 .cse18) 1) .cse124)) (not (= .cse124 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse125) (< .cse125 (select .cse123 .cse92)) (not (= (select .cse123 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse4 (* (select v_arrayElimArr_2 .cse17) 2) .cse124) (+ c_~s~0 .cse126 1)) (< v_~q1_back~0_178 .cse13))))) .cse86) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse127 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse130 (select v_arrayElimArr_2 .cse24))) (let ((.cse131 (+ .cse130 1)) (.cse129 (* (select v_arrayElimArr_2 .cse17) 2)) (.cse128 (select .cse127 .cse93))) (or (not (= 2 (select .cse127 .cse14))) (not (= .cse128 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse4 (* 2 (select v_arrayElimArr_2 .cse87)) .cse129 1) (+ c_~s~0 .cse128 .cse130)) (< 0 .cse131) (< .cse131 (select .cse127 .cse92)) (not (= (select .cse127 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse4 .cse129 .cse128) (+ c_~s~0 .cse130 1)) (< v_~q1_back~0_178 .cse13))))) .cse99) (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse135 (select v_arrayElimArr_2 .cse24))) (let ((.cse136 (+ .cse135 1))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (let ((.cse132 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse134 (* (select v_arrayElimArr_2 .cse17) 2)) (.cse133 (select .cse132 .cse93))) (or (not (= 2 (select .cse132 .cse14))) (not (= (+ (select v_arrayElimArr_2 .cse18) 1) .cse133)) (not (= .cse133 (+ (select v_arrayElimArr_2 .cse22) 1))) (= (+ .cse4 (* 2 (select v_arrayElimArr_2 .cse87)) .cse134 1) (+ c_~s~0 .cse133 .cse135)) (< .cse136 (select .cse132 .cse92)) (not (= (select .cse132 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse4 .cse134 .cse133) (+ c_~s~0 .cse135 1)))))) (< 0 .cse136))))) (< v_~q1_back~0_178 .cse13)))) .cse137)) .cse138) (or (and (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse142 (select v_arrayElimArr_2 .cse87)) (.cse141 (select v_arrayElimArr_2 .cse24)) (.cse139 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse140 (select .cse139 .cse93)) (.cse143 (+ .cse141 1)) (.cse145 (+ .cse142 1)) (.cse144 (select .cse139 .cse92))) (or (not (= 2 (select .cse139 .cse14))) (not (= (+ (select v_arrayElimArr_2 .cse18) 1) .cse140)) (not (= .cse140 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse141 1) (+ .cse4 (* 2 .cse142) .cse140)) (< 0 .cse143) (< .cse143 .cse144) (not (= (select .cse139 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13) (< 0 .cse145) (< .cse145 .cse144))))) .cse114) (or (and (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse148 (select v_arrayElimArr_2 .cse87)) (.cse150 (select v_arrayElimArr_2 .cse24))) (let ((.cse151 (+ .cse150 1)) (.cse153 (+ .cse148 1))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (let ((.cse146 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse149 (* (select v_arrayElimArr_2 .cse17) 2)) (.cse147 (select .cse146 .cse93)) (.cse152 (select .cse146 .cse92))) (or (not (= 2 (select .cse146 .cse14))) (not (= (+ (select v_arrayElimArr_2 .cse18) 1) .cse147)) (not (= .cse147 (+ (select v_arrayElimArr_2 .cse22) 1))) (= (+ .cse4 (* 2 .cse148) .cse149 1) (+ c_~s~0 .cse147 .cse150)) (< .cse151 .cse152) (not (= (select .cse146 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse4 .cse149 .cse147) (+ c_~s~0 .cse150 1)) (< .cse153 .cse152))))) (< 0 .cse151) (< 0 .cse153))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse13))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse156 (select v_arrayElimArr_2 .cse87)) (.cse154 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse158 (select v_arrayElimArr_2 .cse24))) (let ((.cse159 (+ .cse158 1)) (.cse157 (* (select v_arrayElimArr_2 .cse17) 2)) (.cse155 (select .cse154 .cse93)) (.cse161 (+ .cse156 1)) (.cse160 (select .cse154 .cse92))) (or (not (= 2 (select .cse154 .cse14))) (not (= .cse155 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse4 (* 2 .cse156) .cse157 1) (+ c_~s~0 .cse155 .cse158)) (< 0 .cse159) (< .cse159 .cse160) (not (= (select .cse154 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse4 .cse157 .cse155) (+ c_~s~0 .cse158 1)) (< v_~q1_back~0_178 .cse13) (< 0 .cse161) (< .cse161 .cse160))))) .cse99) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse164 (select v_arrayElimArr_2 .cse87)) (.cse165 (select v_arrayElimArr_2 .cse24)) (.cse162 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse163 (select .cse162 .cse93)) (.cse166 (+ .cse165 1)) (.cse168 (+ .cse164 1)) (.cse167 (select .cse162 .cse92))) (or (not (= 2 (select .cse162 .cse14))) (not (= .cse163 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse4 (* 2 .cse164) (* (select v_arrayElimArr_2 .cse17) 2) 1) (+ c_~s~0 .cse163 .cse165)) (< 0 .cse166) (< .cse166 .cse167) (not (= (select .cse162 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13) (< 0 .cse168) (< .cse168 .cse167))))) .cse99) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse169 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse173 (select v_arrayElimArr_2 .cse24))) (let ((.cse171 (+ .cse173 1)) (.cse170 (select .cse169 .cse93)) (.cse174 (+ (select v_arrayElimArr_2 .cse87) 1)) (.cse172 (select .cse169 .cse92))) (or (not (= 2 (select .cse169 .cse14))) (not (= (+ (select v_arrayElimArr_2 .cse18) 1) .cse170)) (not (= .cse170 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse171) (< .cse171 .cse172) (not (= (select .cse169 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse4 (* (select v_arrayElimArr_2 .cse17) 2) .cse170) (+ c_~s~0 .cse173 1)) (< v_~q1_back~0_178 .cse13) (< 0 .cse174) (< .cse174 .cse172))))) .cse86)) (and .cse138 .cse86)) (or .cse138 (and (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse177 (select v_arrayElimArr_2 .cse24)) (.cse175 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse176 (select .cse175 .cse93)) (.cse179 (+ .cse177 1)) (.cse178 (select v_arrayElimArr_2 .cse87)) (.cse180 (select .cse175 .cse92))) (or (not (= 2 (select .cse175 .cse14))) (not (= (+ (select v_arrayElimArr_2 .cse18) 1) .cse176)) (not (= .cse176 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse177 1) (+ .cse4 (* 2 .cse178) .cse176)) (< 0 .cse179) (< .cse179 .cse180) (not (= (select .cse175 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13) (< (+ .cse178 1) .cse180))))) .cse114) (forall ((v_~q1_back~0_178 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse185 (select v_arrayElimArr_2 .cse24))) (let ((.cse186 (+ .cse185 1))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (let ((.cse181 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse184 (* (select v_arrayElimArr_2 .cse17) 2)) (.cse182 (select .cse181 .cse93)) (.cse183 (select v_arrayElimArr_2 .cse87)) (.cse187 (select .cse181 .cse92))) (or (not (= 2 (select .cse181 .cse14))) (not (= (+ (select v_arrayElimArr_2 .cse18) 1) .cse182)) (not (= .cse182 (+ (select v_arrayElimArr_2 .cse22) 1))) (= (+ .cse4 (* 2 .cse183) .cse184 1) (+ c_~s~0 .cse182 .cse185)) (< .cse186 .cse187) (not (= (select .cse181 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse4 .cse184 .cse182) (+ c_~s~0 .cse185 1)) (< (+ .cse183 1) .cse187))))) (< 0 .cse186))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse13))) (or .cse188 .cse99) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse189 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse193 (select v_arrayElimArr_2 .cse24))) (let ((.cse194 (+ .cse193 1)) (.cse192 (* (select v_arrayElimArr_2 .cse17) 2)) (.cse190 (select .cse189 .cse93)) (.cse191 (select v_arrayElimArr_2 .cse87)) (.cse195 (select .cse189 .cse92))) (or (not (= 2 (select .cse189 .cse14))) (not (= .cse190 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse4 (* 2 .cse191) .cse192 1) (+ c_~s~0 .cse190 .cse193)) (< 0 .cse194) (< .cse194 .cse195) (not (= (select .cse189 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse4 .cse192 .cse190) (+ c_~s~0 .cse193 1)) (< v_~q1_back~0_178 .cse13) (< (+ .cse191 1) .cse195))))) .cse99) (or .cse86 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse196 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base)) (.cse200 (select v_arrayElimArr_2 .cse24))) (let ((.cse198 (+ .cse200 1)) (.cse197 (select .cse196 .cse93)) (.cse199 (select .cse196 .cse92))) (or (not (= 2 (select .cse196 .cse14))) (not (= (+ (select v_arrayElimArr_2 .cse18) 1) .cse197)) (not (= .cse197 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse198) (< .cse198 .cse199) (not (= (select .cse196 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (= (+ .cse4 (* (select v_arrayElimArr_2 .cse17) 2) .cse197) (+ c_~s~0 .cse200 1)) (< v_~q1_back~0_178 .cse13) (< (+ (select v_arrayElimArr_2 .cse87) 1) .cse199))))))))) .cse137) (or .cse138 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse203 (select v_arrayElimArr_2 .cse24)) (.cse201 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse202 (select .cse201 .cse93)) (.cse205 (+ .cse203 1)) (.cse204 (select v_arrayElimArr_2 .cse22)) (.cse206 (select .cse201 .cse92))) (or (not (= 2 (select .cse201 .cse14))) (= (+ c_~s~0 .cse202 .cse203) (+ .cse4 (* .cse204 2) 1 (* (select v_arrayElimArr_2 .cse18) 2))) (not (= .cse202 (+ .cse204 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse205) (< .cse205 .cse206) (not (= .cse204 (select v_arrayElimArr_2 .cse17))) (not (= (select .cse201 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13) (< (+ (select v_arrayElimArr_2 .cse87) 1) .cse206)))))) (or (and (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse210 (select v_arrayElimArr_2 .cse87)) (.cse209 (select v_arrayElimArr_2 .cse24)) (.cse207 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse208 (select .cse207 .cse93)) (.cse211 (+ .cse209 1)) (.cse213 (+ .cse210 1)) (.cse212 (select .cse207 .cse92))) (or (not (= 2 (select .cse207 .cse14))) (not (= .cse208 (+ (select v_arrayElimArr_2 .cse22) 1))) (= (+ c_~s~0 .cse208 .cse209) (+ .cse4 (* 2 .cse210) 1 (* (select v_arrayElimArr_2 .cse18) 2))) (< 0 .cse211) (< .cse211 .cse212) (not (= (select .cse207 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< 0 .cse213) (< .cse213 .cse212))))) (< v_~q1_back~0_178 .cse13))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse216 (select v_arrayElimArr_2 .cse24)) (.cse214 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse215 (select .cse214 .cse93)) (.cse218 (+ .cse216 1)) (.cse217 (select v_arrayElimArr_2 .cse87)) (.cse219 (select .cse214 .cse92))) (or (not (= 2 (select .cse214 .cse14))) (not (= .cse215 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ c_~s~0 .cse215 .cse216) (+ .cse4 (* 2 .cse217) 1 (* (select v_arrayElimArr_2 .cse18) 2))) (< 0 .cse218) (< .cse218 .cse219) (not (= (select .cse214 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13) (< (+ .cse217 1) .cse219))))) .cse138)) .cse114) (forall ((v_~q1_back~0_178 Int)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse222 (select v_arrayElimArr_2 .cse24)) (.cse220 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse221 (select .cse220 .cse93)) (.cse224 (+ .cse222 1)) (.cse223 (select v_arrayElimArr_2 .cse22)) (.cse226 (+ (select v_arrayElimArr_2 .cse87) 1)) (.cse225 (select .cse220 .cse92))) (or (not (= 2 (select .cse220 .cse14))) (= (+ c_~s~0 .cse221 .cse222) (+ .cse4 (* .cse223 2) 1 (* (select v_arrayElimArr_2 .cse18) 2))) (not (= .cse221 (+ .cse223 1))) (< 0 .cse224) (< .cse224 .cse225) (not (= .cse223 (select v_arrayElimArr_2 .cse17))) (not (= (select .cse220 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< 0 .cse226) (< .cse226 .cse225))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse13))) (or .cse86 (and (forall ((v_~q1_back~0_178 Int)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse229 (select v_arrayElimArr_2 .cse24)) (.cse227 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse228 (select .cse227 .cse93)) (.cse230 (+ .cse229 1)) (.cse232 (+ (select v_arrayElimArr_2 .cse87) 1)) (.cse231 (select .cse227 .cse92))) (or (not (= 2 (select .cse227 .cse14))) (= (+ c_~s~0 .cse228 .cse229) (+ .cse4 (* (select v_arrayElimArr_2 .cse17) 2) 1 (* (select v_arrayElimArr_2 .cse18) 2))) (not (= .cse228 (+ (select v_arrayElimArr_2 .cse22) 1))) (< 0 .cse230) (< .cse230 .cse231) (not (= (select .cse227 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< 0 .cse232) (< .cse232 .cse231))))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< v_~q1_back~0_178 .cse13))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse235 (select v_arrayElimArr_2 .cse24)) (.cse233 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse234 (select .cse233 .cse93)) (.cse236 (+ .cse235 1)) (.cse237 (select .cse233 .cse92))) (or (not (= 2 (select .cse233 .cse14))) (= (+ c_~s~0 .cse234 .cse235) (+ .cse4 (* (select v_arrayElimArr_2 .cse17) 2) 1 (* (select v_arrayElimArr_2 .cse18) 2))) (not (= .cse234 (+ (select v_arrayElimArr_2 .cse22) 1))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse236) (< .cse236 .cse237) (not (= (select .cse233 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13) (< (+ (select v_arrayElimArr_2 .cse87) 1) .cse237))))) .cse138))) (or (and (or .cse86 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse241 (select v_arrayElimArr_2 .cse24)) (.cse240 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse239 (select .cse240 .cse93)) (.cse242 (+ .cse241 1)) (.cse238 (+ (select v_arrayElimArr_2 .cse87) 1)) (.cse243 (select .cse240 .cse92))) (or (not (= .cse238 .cse239)) (not (= 2 (select .cse240 .cse14))) (= (+ c_~s~0 .cse239 .cse241) (+ .cse4 (* (select v_arrayElimArr_2 .cse17) 2) 1 (* (select v_arrayElimArr_2 .cse18) 2))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (< 0 .cse242) (< .cse242 .cse243) (not (= (select .cse240 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13) (< .cse238 .cse243)))))) (or .cse99 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_~q1_back~0_178 Int)) (let ((.cse247 (select v_arrayElimArr_2 .cse87)) (.cse248 (select v_arrayElimArr_2 .cse24)) (.cse246 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse245 (select .cse246 .cse93)) (.cse249 (+ .cse248 1)) (.cse244 (+ .cse247 1)) (.cse250 (select .cse246 .cse92))) (or (not (= .cse244 .cse245)) (not (= 2 (select .cse246 .cse14))) (< c_~n1~0 (+ v_~q1_back~0_178 1)) (= (+ .cse4 (* 2 .cse247) (* (select v_arrayElimArr_2 .cse17) 2) 1) (+ c_~s~0 .cse245 .cse248)) (< 0 .cse249) (< .cse249 .cse250) (not (= (select .cse246 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< v_~q1_back~0_178 .cse13) (< .cse244 .cse250))))))) .cse100) (or .cse99 (and (or .cse188 .cse138) (forall ((v_~q1_back~0_178 Int)) (or (< c_~n1~0 (+ v_~q1_back~0_178 1)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse253 (select v_arrayElimArr_2 .cse87)) (.cse254 (select v_arrayElimArr_2 .cse24)) (.cse251 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_2) c_~q1~0.base))) (let ((.cse252 (select .cse251 .cse93)) (.cse255 (+ .cse254 1)) (.cse257 (+ .cse253 1)) (.cse256 (select .cse251 .cse92))) (or (not (= 2 (select .cse251 .cse14))) (not (= .cse252 (+ (select v_arrayElimArr_2 .cse22) 1))) (= (+ .cse4 (* 2 .cse253) (* (select v_arrayElimArr_2 .cse17) 2) 1) (+ c_~s~0 .cse252 .cse254)) (< 0 .cse255) (< .cse255 .cse256) (not (= (select .cse251 (+ c_~q1~0.offset (* v_~q1_back~0_178 4))) 0)) (< 0 .cse257) (< .cse257 .cse256))))) (< v_~q1_back~0_178 .cse13)))))))))) (= c_~s~0 (+ 3 .cse79)) (or .cse1 (= .cse29 .cse3) .cse2 .cse7 .cse8) (or .cse1 .cse21 .cse7 .cse80 (= .cse29 (+ c_~s~0 .cse30 |c_thread2Thread1of1ForFork0_~j~0#1|)) .cse32 (< .cse31 .cse20))))))) is different from true [2024-11-09 06:19:43,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:19:46,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:19:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:19:50,758 INFO L93 Difference]: Finished difference Result 18365 states and 63524 transitions. [2024-11-09 06:19:50,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-11-09 06:19:50,758 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.4705882352941178) internal successors, (168), 67 states have internal predecessors, (168), 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 59 [2024-11-09 06:19:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:19:50,817 INFO L225 Difference]: With dead ends: 18365 [2024-11-09 06:19:50,817 INFO L226 Difference]: Without dead ends: 17448 [2024-11-09 06:19:50,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5806 ImplicationChecksByTransitivity, 242.7s TimeCoverageRelationStatistics Valid=1981, Invalid=20367, Unknown=14, NotChecked=894, Total=23256 [2024-11-09 06:19:50,825 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 1491 mSDsluCounter, 6110 mSDsCounter, 0 mSdLazyCounter, 13176 mSolverCounterSat, 244 mSolverCounterUnsat, 97 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 138.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 6268 SdHoareTripleChecker+Invalid, 14822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 13176 IncrementalHoareTripleChecker+Invalid, 97 IncrementalHoareTripleChecker+Unknown, 1305 IncrementalHoareTripleChecker+Unchecked, 141.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:19:50,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 6268 Invalid, 14822 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [244 Valid, 13176 Invalid, 97 Unknown, 1305 Unchecked, 141.7s Time] [2024-11-09 06:19:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17448 states. [2024-11-09 06:19:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17448 to 11089. [2024-11-09 06:19:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11089 states, 11088 states have (on average 3.529491341991342) internal successors, (39135), 11088 states have internal predecessors, (39135), 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) [2024-11-09 06:19:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11089 states to 11089 states and 39135 transitions. [2024-11-09 06:19:51,159 INFO L78 Accepts]: Start accepts. Automaton has 11089 states and 39135 transitions. Word has length 59 [2024-11-09 06:19:51,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:19:51,159 INFO L471 AbstractCegarLoop]: Abstraction has 11089 states and 39135 transitions. [2024-11-09 06:19:51,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.4705882352941178) internal successors, (168), 67 states have internal predecessors, (168), 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) [2024-11-09 06:19:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 11089 states and 39135 transitions. [2024-11-09 06:19:51,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 06:19:51,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:19:51,183 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:19:51,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 06:19:51,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 06:19:51,383 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 06:19:51,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:19:51,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1844792257, now seen corresponding path program 2 times [2024-11-09 06:19:51,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:19:51,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370084923] [2024-11-09 06:19:51,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:19:51,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:19:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:19:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:19:58,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:19:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370084923] [2024-11-09 06:19:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370084923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:19:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417802319] [2024-11-09 06:19:58,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:19:58,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:19:58,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:19:58,752 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:19:58,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b8a483-632c-4eb9-990a-f7360152afeb/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 06:19:58,993 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 06:19:58,994 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:19:58,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 06:19:58,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:07,029 INFO L349 Elim1Store]: treesize reduction 25, result has 61.5 percent of original size [2024-11-09 06:20:07,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 62 [2024-11-09 06:20:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:20:07,704 INFO L311 TraceCheckSpWp]: Computing backward predicates...