./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-patterns/array9_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/array-patterns/array9_pattern.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ae6792b63619c19d32145c9c656ded5ce2ab653945337eaf95cf4eb94965d3b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:34:57,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:34:58,051 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 22:34:58,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:34:58,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:34:58,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:34:58,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:34:58,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 22:34:58,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:34:58,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:34:58,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:34:58,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:34:58,100 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:34:58,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:34:58,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:34:58,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:34:58,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:34:58,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:34:58,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:34:58,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:34:58,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:34:58,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:34:58,110 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:34:58,110 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:34:58,110 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:34:58,110 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:34:58,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:34:58,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:34:58,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:34:58,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:34:58,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:34:58,112 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:34:58,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:34:58,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk/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_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> 8ae6792b63619c19d32145c9c656ded5ce2ab653945337eaf95cf4eb94965d3b [2024-11-08 22:34:58,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:34:58,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:34:58,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:34:58,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:34:58,454 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:34:58,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/array-patterns/array9_pattern.c Unable to find full path for "g++" [2024-11-08 22:35:00,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:35:00,796 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:35:00,797 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/sv-benchmarks/c/array-patterns/array9_pattern.c [2024-11-08 22:35:00,809 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk/data/d59d70b44/fb7032f5f09f41f58754dc8be288254b/FLAG5fd231b1c [2024-11-08 22:35:00,839 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk/data/d59d70b44/fb7032f5f09f41f58754dc8be288254b [2024-11-08 22:35:00,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:35:00,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:35:00,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:35:00,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:35:00,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:35:00,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:35:00" (1/1) ... [2024-11-08 22:35:00,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d3c05c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00, skipping insertion in model container [2024-11-08 22:35:00,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:35:00" (1/1) ... [2024-11-08 22:35:00,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:35:01,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/sv-benchmarks/c/array-patterns/array9_pattern.c[1352,1365] [2024-11-08 22:35:01,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:35:01,178 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:35:01,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/sv-benchmarks/c/array-patterns/array9_pattern.c[1352,1365] [2024-11-08 22:35:01,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:35:01,219 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:35:01,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:01 WrapperNode [2024-11-08 22:35:01,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:35:01,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:35:01,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:35:01,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:35:01,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:01" (1/1) ... [2024-11-08 22:35:01,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:01" (1/1) ... [2024-11-08 22:35:01,258 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-11-08 22:35:01,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:35:01,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:35:01,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:35:01,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:35:01,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:01" (1/1) ... [2024-11-08 22:35:01,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:01" (1/1) ... [2024-11-08 22:35:01,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:01" (1/1) ... [2024-11-08 22:35:01,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:01" (1/1) ... [2024-11-08 22:35:01,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:01" (1/1) ... [2024-11-08 22:35:01,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:01" (1/1) ... [2024-11-08 22:35:01,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:01" (1/1) ... [2024-11-08 22:35:01,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:01" (1/1) ... [2024-11-08 22:35:01,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:35:01,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:35:01,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:35:01,300 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:35:01,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:01" (1/1) ... [2024-11-08 22:35:01,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:35:01,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:35:01,337 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:35:01,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22d73caf-d245-41ae-a167-4092f2afd46f/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:35:01,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:35:01,378 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:35:01,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:35:01,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 22:35:01,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 22:35:01,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 22:35:01,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:35:01,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:35:01,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 22:35:01,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 22:35:01,454 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:35:01,456 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:35:01,756 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-08 22:35:01,756 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:35:01,856 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:35:01,864 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:35:01,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:35:01 BoogieIcfgContainer [2024-11-08 22:35:01,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:35:01,865 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:35:01,865 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:35:01,880 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:35:01,881 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:35:01" (1/1) ... [2024-11-08 22:35:01,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:01,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2024-11-08 22:35:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-11-08 22:35:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 22:35:01,952 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:01,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,112 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-08 22:35:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 21 states and 26 transitions. [2024-11-08 22:35:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-11-08 22:35:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 22:35:02,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:02,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,715 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-08 22:35:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 31 states and 44 transitions. [2024-11-08 22:35:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2024-11-08 22:35:02,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 22:35:02,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:02,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,989 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-08 22:35:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 31 states and 42 transitions. [2024-11-08 22:35:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2024-11-08 22:35:03,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 22:35:03,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:03,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,081 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-08 22:35:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 31 states and 40 transitions. [2024-11-08 22:35:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2024-11-08 22:35:03,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 22:35:03,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:35:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 33 states and 43 transitions. [2024-11-08 22:35:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-08 22:35:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:35:03,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:03,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 22:35:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 34 states and 45 transitions. [2024-11-08 22:35:04,198 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-11-08 22:35:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:35:04,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:04,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:35:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 22:35:04,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:35:04,373 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 10 treesize of output 8 [2024-11-08 22:35:04,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-08 22:35:04,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2024-11-08 22:35:04,533 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 7 [2024-11-08 22:35:05,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 22:35:05,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 18 [2024-11-08 22:35:05,410 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-08 22:35:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 47 states and 72 transitions. [2024-11-08 22:35:08,732 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 72 transitions. [2024-11-08 22:35:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:35:08,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:35:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 59 states and 97 transitions. [2024-11-08 22:35:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 97 transitions. [2024-11-08 22:35:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:35:11,734 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:11,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:35:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 67 states and 107 transitions. [2024-11-08 22:35:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2024-11-08 22:35:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:35:12,306 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:12,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:35:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 68 states and 108 transitions. [2024-11-08 22:35:13,040 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 108 transitions. [2024-11-08 22:35:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:35:13,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:13,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:35:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 69 states and 109 transitions. [2024-11-08 22:35:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 109 transitions. [2024-11-08 22:35:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 22:35:13,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:13,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:35:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:13,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 22:35:13,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:35:13,631 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 10 treesize of output 8 [2024-11-08 22:35:13,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2024-11-08 22:35:13,788 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 22:35:13,789 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2024-11-08 22:35:13,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 22:35:13,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-08 22:35:14,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2024-11-08 22:35:15,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 22:35:15,266 INFO L349 Elim1Store]: treesize reduction 60, result has 50.4 percent of original size [2024-11-08 22:35:15,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 107 [2024-11-08 22:35:17,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 22:35:17,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 167 treesize of output 135 [2024-11-08 22:35:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 86 states and 147 transitions. [2024-11-08 22:35:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 147 transitions. [2024-11-08 22:35:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 22:35:28,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:28,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:35:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:28,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-08 22:35:28,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:35:28,884 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 10 treesize of output 8 [2024-11-08 22:35:28,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2024-11-08 22:35:28,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-08 22:35:28,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-08 22:35:28,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2024-11-08 22:35:29,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 22:35:29,449 INFO L349 Elim1Store]: treesize reduction 72, result has 40.5 percent of original size [2024-11-08 22:35:29,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 107 [2024-11-08 22:35:31,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 22:35:31,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 140 treesize of output 124 [2024-11-08 22:35:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 96 states and 167 transitions. [2024-11-08 22:35:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 167 transitions. [2024-11-08 22:35:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 22:35:39,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:39,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:35:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:39,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 22:35:39,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:35:39,227 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 10 treesize of output 8 [2024-11-08 22:35:39,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2024-11-08 22:35:39,279 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 22:35:39,280 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2024-11-08 22:35:39,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 22:35:39,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-08 22:35:39,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2024-11-08 22:35:39,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 22:35:39,766 INFO L349 Elim1Store]: treesize reduction 60, result has 50.4 percent of original size [2024-11-08 22:35:39,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 107 [2024-11-08 22:35:40,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 22:35:40,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 167 treesize of output 135 [2024-11-08 22:35:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 97 states and 167 transitions. [2024-11-08 22:35:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 167 transitions. [2024-11-08 22:35:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:35:43,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:43,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:35:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:43,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 22:35:43,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:35:43,523 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 10 treesize of output 8 [2024-11-08 22:35:43,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-08 22:35:43,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2024-11-08 22:35:43,750 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 7 [2024-11-08 22:35:43,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 22:35:43,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2024-11-08 22:35:43,994 INFO L349 Elim1Store]: treesize reduction 18, result has 52.6 percent of original size [2024-11-08 22:35:43,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 22:35:44,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 22:35:44,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 22 [2024-11-08 22:35:44,986 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-08 22:35:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 101 states and 176 transitions. [2024-11-08 22:35:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 176 transitions. [2024-11-08 22:35:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:35:47,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:47,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:35:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 113 states and 210 transitions. [2024-11-08 22:35:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 210 transitions. [2024-11-08 22:35:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:35:57,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:57,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:35:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 115 states and 214 transitions. [2024-11-08 22:35:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 214 transitions. [2024-11-08 22:35:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:35:59,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:59,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 22:36:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 116 states and 214 transitions. [2024-11-08 22:36:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 214 transitions. [2024-11-08 22:36:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:36:00,221 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:00,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 22:36:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 99 states and 178 transitions. [2024-11-08 22:36:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 178 transitions. [2024-11-08 22:36:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:36:00,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:00,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:00,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:36:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 107 states and 193 transitions. [2024-11-08 22:36:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 193 transitions. [2024-11-08 22:36:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:36:06,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:06,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:36:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 118 states and 213 transitions. [2024-11-08 22:36:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 213 transitions. [2024-11-08 22:36:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:36:15,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:36:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 127 states and 224 transitions. [2024-11-08 22:36:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 224 transitions. [2024-11-08 22:36:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:36:22,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:22,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:36:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 129 states and 225 transitions. [2024-11-08 22:36:26,740 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 225 transitions. [2024-11-08 22:36:26,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 22:36:26,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:26,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 22:36:27,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 131 states and 226 transitions. [2024-11-08 22:36:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 226 transitions. [2024-11-08 22:36:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 22:36:27,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:27,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:36:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:27,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-08 22:36:27,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:36:27,722 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 10 treesize of output 8 [2024-11-08 22:36:27,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2024-11-08 22:36:27,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-08 22:36:27,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-08 22:36:27,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2024-11-08 22:36:28,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2024-11-08 22:36:30,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 22:36:30,324 INFO L349 Elim1Store]: treesize reduction 102, result has 43.6 percent of original size [2024-11-08 22:36:30,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 125 treesize of output 143 [2024-11-08 22:36:56,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 22:36:56,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 185 treesize of output 149 [2024-11-08 22:36:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:37:02,078 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse16 (select .cse6 0)) (.cse17 (select .cse8 4)) (.cse18 (select .cse6 4))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse8 0))) (.cse11 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse12 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse2 (= .cse18 1)) (.cse3 (= (+ .cse17 1) 0)) (.cse9 (= .cse16 1)) (.cse5 (= .cse18 0)) (.cse10 (= .cse17 0)) (.cse4 (<= .cse16 0))) (and .cse0 .cse1 (<= |c_ULTIMATE.start_main_~sum~0#1| 0) (<= 3 c_~ARR_SIZE~0) (not (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4) (and (or (and .cse5 (or (exists ((v_y_3 Int)) (and (<= (+ (* 3 v_y_3) 1) c_~ARR_SIZE~0) (= (select .cse6 (* v_y_3 12)) 1) (<= 0 v_y_3))) (exists ((|v_ULTIMATE.start_main_~index~0#1_25| Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~index~0#1_25|))) (and (= 1 (select .cse6 .cse7)) (<= 0 |v_ULTIMATE.start_main_~index~0#1_25|) (= (+ (select .cse8 .cse7) 1) 0) (<= (+ |v_ULTIMATE.start_main_~index~0#1_25| 1) c_~ARR_SIZE~0))))) .cse4) (and .cse9 .cse5)) .cse10)) .cse11 .cse12)) .cse11 .cse12 (= |c_ULTIMATE.start_main_~sum~0#1| 0) (let ((.cse14 (select .cse8 8)) (.cse13 (select .cse6 8))) (or (and (= .cse13 0) (= .cse14 0) (or (and (or (and .cse2 .cse3) (and (or (exists ((v_y_6 Int)) (= (select .cse6 (* v_y_6 12)) 1)) (exists ((|v_ULTIMATE.start_main_~index~0#1_29| Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~index~0#1_29|))) (and (= (+ (select .cse8 .cse15) 1) 0) (= (select .cse6 .cse15) 1))))) .cse5 .cse10)) .cse4) (and .cse9 .cse5 .cse10))) (and (= (+ .cse14 1) 0) .cse5 (= .cse13 1) .cse10 .cse4))))))) is different from false [2024-11-08 22:37:24,504 WARN L286 SmtUtils]: Spent 13.65s on a formula simplification. DAG size of input: 99 DAG size of output: 92 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:37:25,192 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse16 (select .cse6 0)) (.cse17 (select .cse8 4)) (.cse18 (select .cse6 4))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse8 0))) (.cse11 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse12 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse2 (= .cse18 1)) (.cse3 (= (+ .cse17 1) 0)) (.cse9 (= .cse16 1)) (.cse5 (= .cse18 0)) (.cse10 (= .cse17 0)) (.cse4 (<= .cse16 0))) (and .cse0 .cse1 (<= |c_ULTIMATE.start_main_~sum~0#1| 0) (<= 3 c_~ARR_SIZE~0) (not (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4) (and (or (and .cse5 (or (exists ((v_y_3 Int)) (and (<= (+ (* 3 v_y_3) 1) c_~ARR_SIZE~0) (= (select .cse6 (* v_y_3 12)) 1) (<= 0 v_y_3))) (exists ((|v_ULTIMATE.start_main_~index~0#1_25| Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~index~0#1_25|))) (and (= 1 (select .cse6 .cse7)) (<= 0 |v_ULTIMATE.start_main_~index~0#1_25|) (= (+ (select .cse8 .cse7) 1) 0) (<= (+ |v_ULTIMATE.start_main_~index~0#1_25| 1) c_~ARR_SIZE~0))))) .cse4) (and .cse9 .cse5)) .cse10)) .cse11 .cse12)) .cse11 .cse12 (= |c_ULTIMATE.start_main_~sum~0#1| 0) (let ((.cse14 (select .cse8 8)) (.cse13 (select .cse6 8))) (or (and (= .cse13 0) (= .cse14 0) (or (and (or (and .cse2 .cse3) (and (or (exists ((v_y_6 Int)) (= (select .cse6 (* v_y_6 12)) 1)) (exists ((|v_ULTIMATE.start_main_~index~0#1_29| Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~index~0#1_29|))) (and (= (+ (select .cse8 .cse15) 1) 0) (= (select .cse6 .cse15) 1))))) .cse5 .cse10)) .cse4) (and .cse9 .cse5 .cse10))) (and (= (+ .cse14 1) 0) .cse5 (= .cse13 1) .cse10 .cse4)))))))) is different from true [2024-11-08 22:39:24,467 WARN L286 SmtUtils]: Spent 26.77s on a formula simplification. DAG size of input: 99 DAG size of output: 81 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:39:49,445 WARN L286 SmtUtils]: Spent 15.36s on a formula simplification. DAG size of input: 101 DAG size of output: 94 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:39:50,033 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= 0 (select .cse0 0)) (not (or (exists ((v_y_3 Int)) (and (<= (+ (* 3 v_y_3) 1) c_~ARR_SIZE~0) (= (select .cse1 (* v_y_3 12)) 1) (<= 0 v_y_3))) (exists ((|v_ULTIMATE.start_main_~index~0#1_25| Int)) (let ((.cse2 (* 4 |v_ULTIMATE.start_main_~index~0#1_25|))) (and (= 1 (select .cse1 .cse2)) (<= 0 |v_ULTIMATE.start_main_~index~0#1_25|) (= (+ (select .cse0 .cse2) 1) 0) (<= (+ |v_ULTIMATE.start_main_~index~0#1_25| 1) c_~ARR_SIZE~0)))))) (= |c_ULTIMATE.start_main_~count~0#1| 0) (<= 3 c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (let ((.cse5 (select .cse0 8)) (.cse6 (= (select .cse1 4) 0)) (.cse4 (select .cse1 8)) (.cse7 (= (select .cse0 4) 0)) (.cse8 (<= (select .cse1 0) 0))) (or (and (or (exists ((v_y_6 Int)) (= (select .cse1 (* v_y_6 12)) 1)) (exists ((|v_ULTIMATE.start_main_~index~0#1_29| Int)) (let ((.cse3 (* 4 |v_ULTIMATE.start_main_~index~0#1_29|))) (and (= (+ (select .cse0 .cse3) 1) 0) (= (select .cse1 .cse3) 1))))) (= .cse4 0) (= .cse5 0) .cse6 .cse7 .cse8) (and (= (+ .cse5 1) 0) .cse6 (= .cse4 1) .cse7 .cse8))) (= |c_ULTIMATE.start_main_~sum~0#1| 0)))) is different from true [2024-11-08 22:39:57,421 WARN L286 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 95 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:39:58,758 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse18 (select .cse8 0)) (.cse19 (select .cse10 4)) (.cse20 (select .cse8 4)) (.cse13 (select .cse10 0))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 .cse13)) (.cse2 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse5 (= .cse20 1)) (.cse6 (+ .cse19 1)) (.cse12 (= .cse18 1)) (.cse14 (= .cse20 0)) (.cse11 (= .cse19 0)) (.cse7 (<= .cse18 0))) (and .cse0 .cse1 .cse2 (= |c_ULTIMATE.start_main_~count~0#1| 0) (<= 3 c_~ARR_SIZE~0) .cse3 .cse4 (not (and .cse0 (or (and .cse1 .cse5 (<= .cse6 0) .cse7) (and (or (and .cse1 (or (exists ((v_y_1 Int)) (and (= (select .cse8 (* v_y_1 12)) 1) (<= 0 v_y_1) (<= (+ (* 3 v_y_1) 1) c_~ARR_SIZE~0))) (exists ((|v_ULTIMATE.start_main_~index~0#1_24| Int)) (let ((.cse9 (* 4 |v_ULTIMATE.start_main_~index~0#1_24|))) (and (= (select .cse8 .cse9) 1) (<= (+ |v_ULTIMATE.start_main_~index~0#1_24| 1) c_~ARR_SIZE~0) (<= (+ (select .cse10 .cse9) 1) 0) (<= 0 |v_ULTIMATE.start_main_~index~0#1_24|))))) .cse11 .cse7) (and .cse12 (or .cse1 (< .cse13 0)) .cse11)) .cse14)) .cse2 .cse3 .cse4)) (let ((.cse16 (select .cse10 8)) (.cse15 (select .cse8 8))) (or (and (= .cse15 0) (= .cse16 0) (or (and (or (and .cse5 (= .cse6 0)) (and (or (exists ((v_y_6 Int)) (= (select .cse8 (* v_y_6 12)) 1)) (exists ((|v_ULTIMATE.start_main_~index~0#1_29| Int)) (let ((.cse17 (* 4 |v_ULTIMATE.start_main_~index~0#1_29|))) (and (= (+ (select .cse10 .cse17) 1) 0) (= (select .cse8 .cse17) 1))))) .cse14 .cse11)) .cse7) (and .cse12 .cse14 .cse11))) (and (= (+ .cse16 1) 0) .cse14 (= .cse15 1) .cse11 .cse7))))))) is different from false [2024-11-08 22:40:16,206 WARN L286 SmtUtils]: Spent 17.29s on a formula simplification. DAG size of input: 103 DAG size of output: 96 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:40:16,882 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse18 (select .cse8 0)) (.cse19 (select .cse10 4)) (.cse20 (select .cse8 4)) (.cse13 (select .cse10 0))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 .cse13)) (.cse2 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse5 (= .cse20 1)) (.cse6 (+ .cse19 1)) (.cse12 (= .cse18 1)) (.cse14 (= .cse20 0)) (.cse11 (= .cse19 0)) (.cse7 (<= .cse18 0))) (and .cse0 .cse1 .cse2 (= |c_ULTIMATE.start_main_~count~0#1| 0) (<= 3 c_~ARR_SIZE~0) .cse3 .cse4 (not (and .cse0 (or (and .cse1 .cse5 (<= .cse6 0) .cse7) (and (or (and .cse1 (or (exists ((v_y_1 Int)) (and (= (select .cse8 (* v_y_1 12)) 1) (<= 0 v_y_1) (<= (+ (* 3 v_y_1) 1) c_~ARR_SIZE~0))) (exists ((|v_ULTIMATE.start_main_~index~0#1_24| Int)) (let ((.cse9 (* 4 |v_ULTIMATE.start_main_~index~0#1_24|))) (and (= (select .cse8 .cse9) 1) (<= (+ |v_ULTIMATE.start_main_~index~0#1_24| 1) c_~ARR_SIZE~0) (<= (+ (select .cse10 .cse9) 1) 0) (<= 0 |v_ULTIMATE.start_main_~index~0#1_24|))))) .cse11 .cse7) (and .cse12 (or .cse1 (< .cse13 0)) .cse11)) .cse14)) .cse2 .cse3 .cse4)) (let ((.cse16 (select .cse10 8)) (.cse15 (select .cse8 8))) (or (and (= .cse15 0) (= .cse16 0) (or (and (or (and .cse5 (= .cse6 0)) (and (or (exists ((v_y_6 Int)) (= (select .cse8 (* v_y_6 12)) 1)) (exists ((|v_ULTIMATE.start_main_~index~0#1_29| Int)) (let ((.cse17 (* 4 |v_ULTIMATE.start_main_~index~0#1_29|))) (and (= (+ (select .cse10 .cse17) 1) 0) (= (select .cse8 .cse17) 1))))) .cse14 .cse11)) .cse7) (and .cse12 .cse14 .cse11))) (and (= (+ .cse16 1) 0) .cse14 (= .cse15 1) .cse11 .cse7)))))))) is different from true [2024-11-08 22:40:23,342 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse14 (select .cse7 0)) (.cse19 (select .cse9 4)) (.cse20 (select .cse7 4)) (.cse12 (select .cse9 0))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse2 (= 0 .cse12)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse15 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse4 (= .cse20 1)) (.cse5 (+ .cse19 1)) (.cse11 (= .cse14 1)) (.cse13 (= .cse20 0)) (.cse10 (= .cse19 0)) (.cse6 (<= .cse14 0))) (and .cse0 .cse1 .cse2 (not (and (<= |c_ULTIMATE.start_main_~sum~0#1| 1) (= c_~ARR_SIZE~0 1))) (not (and (<= 1 c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (<= (+ |c_ULTIMATE.start_main_~count~0#1| 2) c_~ARR_SIZE~0) (<= 3 c_~ARR_SIZE~0) .cse3 (not (and .cse0 .cse1 (or (and .cse2 .cse4 (<= .cse5 0) .cse6) (and (or (and .cse2 (or (exists ((v_y_1 Int)) (and (= (select .cse7 (* v_y_1 12)) 1) (<= 0 v_y_1) (<= (+ (* 3 v_y_1) 1) c_~ARR_SIZE~0))) (exists ((|v_ULTIMATE.start_main_~index~0#1_24| Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~index~0#1_24|))) (and (= (select .cse7 .cse8) 1) (<= (+ |v_ULTIMATE.start_main_~index~0#1_24| 1) c_~ARR_SIZE~0) (<= (+ (select .cse9 .cse8) 1) 0) (<= 0 |v_ULTIMATE.start_main_~index~0#1_24|))))) .cse10 .cse6) (and .cse11 (or .cse2 (< .cse12 0)) .cse10)) .cse13)) (<= |c_ULTIMATE.start_main_~sum~0#1| (+ .cse14 .cse12)) .cse3 .cse15)) .cse15 (not (= |c_ULTIMATE.start_main_~count~0#1| 0)) (<= |c_ULTIMATE.start_main_~sum~0#1| .cse14) (let ((.cse17 (select .cse9 8)) (.cse16 (select .cse7 8))) (or (and (= .cse16 0) (= .cse17 0) (or (and (or (and .cse4 (= .cse5 0)) (and (or (exists ((v_y_6 Int)) (= (select .cse7 (* v_y_6 12)) 1)) (exists ((|v_ULTIMATE.start_main_~index~0#1_29| Int)) (let ((.cse18 (* 4 |v_ULTIMATE.start_main_~index~0#1_29|))) (and (= (+ (select .cse9 .cse18) 1) 0) (= (select .cse7 .cse18) 1))))) .cse13 .cse10)) .cse6) (and .cse11 .cse13 .cse10))) (and (= (+ .cse17 1) 0) .cse13 (= .cse16 1) .cse10 .cse6))))))) is different from false [2024-11-08 22:40:44,646 WARN L286 SmtUtils]: Spent 13.36s on a formula simplification. DAG size of input: 118 DAG size of output: 110 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:40:45,319 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse14 (select .cse7 0)) (.cse19 (select .cse9 4)) (.cse20 (select .cse7 4)) (.cse12 (select .cse9 0))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse2 (= 0 .cse12)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse15 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse4 (= .cse20 1)) (.cse5 (+ .cse19 1)) (.cse11 (= .cse14 1)) (.cse13 (= .cse20 0)) (.cse10 (= .cse19 0)) (.cse6 (<= .cse14 0))) (and .cse0 .cse1 .cse2 (not (and (<= |c_ULTIMATE.start_main_~sum~0#1| 1) (= c_~ARR_SIZE~0 1))) (not (and (<= 1 c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (<= (+ |c_ULTIMATE.start_main_~count~0#1| 2) c_~ARR_SIZE~0) (<= 3 c_~ARR_SIZE~0) .cse3 (not (and .cse0 .cse1 (or (and .cse2 .cse4 (<= .cse5 0) .cse6) (and (or (and .cse2 (or (exists ((v_y_1 Int)) (and (= (select .cse7 (* v_y_1 12)) 1) (<= 0 v_y_1) (<= (+ (* 3 v_y_1) 1) c_~ARR_SIZE~0))) (exists ((|v_ULTIMATE.start_main_~index~0#1_24| Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~index~0#1_24|))) (and (= (select .cse7 .cse8) 1) (<= (+ |v_ULTIMATE.start_main_~index~0#1_24| 1) c_~ARR_SIZE~0) (<= (+ (select .cse9 .cse8) 1) 0) (<= 0 |v_ULTIMATE.start_main_~index~0#1_24|))))) .cse10 .cse6) (and .cse11 (or .cse2 (< .cse12 0)) .cse10)) .cse13)) (<= |c_ULTIMATE.start_main_~sum~0#1| (+ .cse14 .cse12)) .cse3 .cse15)) .cse15 (not (= |c_ULTIMATE.start_main_~count~0#1| 0)) (<= |c_ULTIMATE.start_main_~sum~0#1| .cse14) (let ((.cse17 (select .cse9 8)) (.cse16 (select .cse7 8))) (or (and (= .cse16 0) (= .cse17 0) (or (and (or (and .cse4 (= .cse5 0)) (and (or (exists ((v_y_6 Int)) (= (select .cse7 (* v_y_6 12)) 1)) (exists ((|v_ULTIMATE.start_main_~index~0#1_29| Int)) (let ((.cse18 (* 4 |v_ULTIMATE.start_main_~index~0#1_29|))) (and (= (+ (select .cse9 .cse18) 1) 0) (= (select .cse7 .cse18) 1))))) .cse13 .cse10)) .cse6) (and .cse11 .cse13 .cse10))) (and (= (+ .cse17 1) 0) .cse13 (= .cse16 1) .cse10 .cse6)))))))) is different from true [2024-11-08 22:40:52,659 WARN L286 SmtUtils]: Spent 6.31s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:42:34,317 WARN L286 SmtUtils]: Spent 22.69s on a formula simplification. DAG size of input: 108 DAG size of output: 81 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:42:48,285 WARN L286 SmtUtils]: Spent 13.38s on a formula simplification. DAG size of input: 110 DAG size of output: 102 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:42:48,770 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse8 (select .cse1 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= |c_ULTIMATE.start_main_~count~0#1| 1) (= 0 (select .cse0 0)) (<= 3 c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (let ((.cse4 (select .cse0 8)) (.cse5 (= (select .cse1 4) 0)) (.cse3 (select .cse1 8)) (.cse6 (= (select .cse0 4) 0)) (.cse7 (<= .cse8 0))) (or (and (or (exists ((v_y_6 Int)) (= (select .cse1 (* v_y_6 12)) 1)) (exists ((|v_ULTIMATE.start_main_~index~0#1_29| Int)) (let ((.cse2 (* 4 |v_ULTIMATE.start_main_~index~0#1_29|))) (and (= (+ (select .cse0 .cse2) 1) 0) (= (select .cse1 .cse2) 1))))) (= .cse3 0) (= .cse4 0) .cse5 .cse6 .cse7) (and (= (+ .cse4 1) 0) .cse5 (= .cse3 1) .cse6 .cse7))) (<= |c_ULTIMATE.start_main_~sum~0#1| .cse8) (not (or (exists ((v_y_1 Int)) (and (= (select .cse1 (* v_y_1 12)) 1) (<= 0 v_y_1) (<= (+ (* 3 v_y_1) 1) c_~ARR_SIZE~0))) (exists ((|v_ULTIMATE.start_main_~index~0#1_24| Int)) (let ((.cse9 (* 4 |v_ULTIMATE.start_main_~index~0#1_24|))) (and (= (select .cse1 .cse9) 1) (<= (+ |v_ULTIMATE.start_main_~index~0#1_24| 1) c_~ARR_SIZE~0) (<= (+ (select .cse0 .cse9) 1) 0) (<= 0 |v_ULTIMATE.start_main_~index~0#1_24|)))))))))) is different from true [2024-11-08 22:42:58,862 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:43:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:43:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 140 states and 264 transitions. [2024-11-08 22:43:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 264 transitions. [2024-11-08 22:43:05,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 22:43:05,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:43:05,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:43:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:05,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-08 22:43:05,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:43:05,662 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 10 treesize of output 8 [2024-11-08 22:43:06,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2024-11-08 22:43:06,810 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 22:43:06,811 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2024-11-08 22:43:06,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 22:43:06,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-08 22:43:08,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2024-11-08 22:43:09,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2024-11-08 22:43:10,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 22:43:11,019 INFO L349 Elim1Store]: treesize reduction 90, result has 50.3 percent of original size [2024-11-08 22:43:11,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 113 treesize of output 143 [2024-11-08 22:43:17,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 22:43:17,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 244 treesize of output 184 [2024-11-08 22:43:19,259 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:43:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:43:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 153 states and 300 transitions. [2024-11-08 22:43:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 300 transitions. [2024-11-08 22:43:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 22:43:47,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:43:47,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:43:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:47,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-08 22:43:47,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:43:47,957 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 10 treesize of output 8 [2024-11-08 22:43:47,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2024-11-08 22:43:47,994 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 22:43:47,995 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2024-11-08 22:43:47,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 22:43:48,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-08 22:43:48,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2024-11-08 22:43:48,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2024-11-08 22:43:49,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 22:43:49,283 INFO L349 Elim1Store]: treesize reduction 102, result has 43.6 percent of original size [2024-11-08 22:43:49,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 125 treesize of output 143 [2024-11-08 22:48:01,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 22:48:01,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 203 treesize of output 187 [2024-11-08 22:48:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:49:31,860 WARN L286 SmtUtils]: Spent 1.32m on a formula simplification. DAG size of input: 103 DAG size of output: 98 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)