./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-optional-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:45:33,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:45:33,467 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-13 23:45:33,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:45:33,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:45:33,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:45:33,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:45:33,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:45:33,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:45:33,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:45:33,516 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:45:33,516 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:45:33,516 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:45:33,516 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-13 23:45:33,517 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:45:33,517 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:45:33,517 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-13 23:45:33,518 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-13 23:45:33,518 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:45:33,518 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-13 23:45:33,518 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-13 23:45:33,518 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-13 23:45:33,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:45:33,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:45:33,519 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:45:33,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:45:33,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:45:33,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:45:33,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:45:33,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:45:33,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:45:33,520 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:45:33,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:45:33,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:45:33,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:45:33,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:45:33,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:45:33,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:45:33,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:45:33,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:45:33,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:45:33,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:45:33,522 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-13 23:45:33,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:45:33,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:45:33,523 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:45:33,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 23:45:33,523 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E 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 -> 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 -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2024-11-13 23:45:33,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:45:33,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:45:33,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:45:33,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:45:33,879 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:45:33,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/forester-heap/sll-optional-1.i Unable to find full path for "g++" [2024-11-13 23:45:35,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:45:36,347 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:45:36,347 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/sv-benchmarks/c/forester-heap/sll-optional-1.i [2024-11-13 23:45:36,359 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/data/1e7a65c67/3581b9f0710f4e098c2e335605dffb5b/FLAG2ef67908a [2024-11-13 23:45:36,373 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/data/1e7a65c67/3581b9f0710f4e098c2e335605dffb5b [2024-11-13 23:45:36,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:45:36,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:45:36,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:45:36,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:45:36,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:45:36,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:45:36" (1/1) ... [2024-11-13 23:45:36,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d6bfaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:45:36, skipping insertion in model container [2024-11-13 23:45:36,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:45:36" (1/1) ... [2024-11-13 23:45:36,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:45:36,793 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_8b77d41c-716f-4143-ac12-03c88c775a5c/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2024-11-13 23:45:36,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:45:36,811 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:45:36,876 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_8b77d41c-716f-4143-ac12-03c88c775a5c/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2024-11-13 23:45:36,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:45:36,906 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:45:36,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:45:36 WrapperNode [2024-11-13 23:45:36,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:45:36,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:45:36,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:45:36,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:45:36,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:45:36" (1/1) ... [2024-11-13 23:45:36,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:45:36" (1/1) ... [2024-11-13 23:45:36,956 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 129 [2024-11-13 23:45:36,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:45:36,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:45:36,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:45:36,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:45:36,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:45:36" (1/1) ... [2024-11-13 23:45:36,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:45:36" (1/1) ... [2024-11-13 23:45:36,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:45:36" (1/1) ... [2024-11-13 23:45:36,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:45:36" (1/1) ... [2024-11-13 23:45:36,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:45:36" (1/1) ... [2024-11-13 23:45:36,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:45:36" (1/1) ... [2024-11-13 23:45:36,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:45:36" (1/1) ... [2024-11-13 23:45:36,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:45:36" (1/1) ... [2024-11-13 23:45:36,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:45:36,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:45:36,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:45:36,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:45:36,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:45:36" (1/1) ... [2024-11-13 23:45:36,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:45:37,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:45:37,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:45:37,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:45:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 23:45:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 23:45:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 23:45:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:45:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 23:45:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 23:45:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 23:45:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:45:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:45:37,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:45:37,212 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:45:37,215 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:45:37,571 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-13 23:45:37,572 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:45:37,801 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:45:37,803 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-13 23:45:37,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:45:37 BoogieIcfgContainer [2024-11-13 23:45:37,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:45:37,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:45:37,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:45:37,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:45:37,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:45:36" (1/3) ... [2024-11-13 23:45:37,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ca194b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:45:37, skipping insertion in model container [2024-11-13 23:45:37,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:45:36" (2/3) ... [2024-11-13 23:45:37,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ca194b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:45:37, skipping insertion in model container [2024-11-13 23:45:37,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:45:37" (3/3) ... [2024-11-13 23:45:37,818 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2024-11-13 23:45:37,836 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:45:37,838 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-optional-1.i that has 1 procedures, 13 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-13 23:45:37,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:45:37,935 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e3550d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:45:37,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 23:45:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 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-13 23:45:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 23:45:37,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:45:37,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:45:37,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:45:37,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:45:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1191364697, now seen corresponding path program 1 times [2024-11-13 23:45:37,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:45:37,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281107728] [2024-11-13 23:45:37,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:45:37,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:45:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:45:38,315 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-13 23:45:38,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:45:38,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281107728] [2024-11-13 23:45:38,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281107728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:45:38,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:45:38,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:45:38,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064816513] [2024-11-13 23:45:38,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:45:38,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 23:45:38,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:45:38,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 23:45:38,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 23:45:38,356 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-13 23:45:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:45:38,529 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2024-11-13 23:45:38,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 23:45:38,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-13 23:45:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:45:38,541 INFO L225 Difference]: With dead ends: 23 [2024-11-13 23:45:38,542 INFO L226 Difference]: Without dead ends: 11 [2024-11-13 23:45:38,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 23:45:38,551 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:45:38,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:45:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-13 23:45:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-13 23:45:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:45:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-11-13 23:45:38,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 7 [2024-11-13 23:45:38,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:45:38,590 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-13 23:45:38,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-13 23:45:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2024-11-13 23:45:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 23:45:38,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:45:38,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:45:38,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 23:45:38,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:45:38,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:45:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1014330300, now seen corresponding path program 1 times [2024-11-13 23:45:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:45:38,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913070100] [2024-11-13 23:45:38,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:45:38,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:45:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:45:40,905 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-13 23:45:40,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:45:40,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913070100] [2024-11-13 23:45:40,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913070100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:45:40,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:45:40,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:45:40,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62077663] [2024-11-13 23:45:40,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:45:40,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:45:40,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:45:40,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:45:40,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:45:40,909 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-13 23:45:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:45:41,571 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-13 23:45:41,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:45:41,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-13 23:45:41,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:45:41,573 INFO L225 Difference]: With dead ends: 28 [2024-11-13 23:45:41,573 INFO L226 Difference]: Without dead ends: 26 [2024-11-13 23:45:41,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:45:41,574 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 20 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:45:41,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 27 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 23:45:41,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-13 23:45:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2024-11-13 23:45:41,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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-13 23:45:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-13 23:45:41,581 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 8 [2024-11-13 23:45:41,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:45:41,581 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-13 23:45:41,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-13 23:45:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-13 23:45:41,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 23:45:41,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:45:41,582 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:45:41,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 23:45:41,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:45:41,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:45:41,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1698756053, now seen corresponding path program 1 times [2024-11-13 23:45:41,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:45:41,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780063711] [2024-11-13 23:45:41,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:45:41,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:45:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:45:44,763 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-13 23:45:44,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:45:44,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780063711] [2024-11-13 23:45:44,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780063711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:45:44,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740805231] [2024-11-13 23:45:44,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:45:44,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:45:44,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:45:44,769 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:45:44,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 23:45:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:45:45,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-13 23:45:45,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:45:45,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:45,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-13 23:45:45,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2024-11-13 23:45:45,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2024-11-13 23:45:45,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:45,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-13 23:45:45,501 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 12 treesize of output 11 [2024-11-13 23:45:45,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-11-13 23:45:45,528 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 12 treesize of output 11 [2024-11-13 23:45:45,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 23:45:45,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:45,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-13 23:45:45,606 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-13 23:45:45,632 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-13 23:45:45,644 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-13 23:45:45,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 103 [2024-11-13 23:45:45,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 97 [2024-11-13 23:45:45,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 91 [2024-11-13 23:45:45,846 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-13 23:45:45,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2024-11-13 23:45:45,985 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2024-11-13 23:45:46,001 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-13 23:45:46,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2024-11-13 23:45:46,048 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 5 treesize of output 3 [2024-11-13 23:45:46,090 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 5 treesize of output 3 [2024-11-13 23:45:46,129 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 9 treesize of output 8 [2024-11-13 23:45:46,139 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-13 23:45:46,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:46,161 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 11 treesize of output 1 [2024-11-13 23:45:46,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:46,707 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-13 23:45:46,708 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 361 treesize of output 341 [2024-11-13 23:45:46,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:46,844 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-11-13 23:45:46,844 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 329 treesize of output 326 [2024-11-13 23:45:46,971 INFO L349 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2024-11-13 23:45:46,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 307 treesize of output 354 [2024-11-13 23:45:47,077 INFO L349 Elim1Store]: treesize reduction 112, result has 8.9 percent of original size [2024-11-13 23:45:47,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 323 treesize of output 348 [2024-11-13 23:45:47,224 INFO L349 Elim1Store]: treesize reduction 160, result has 8.6 percent of original size [2024-11-13 23:45:47,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 291 treesize of output 325 [2024-11-13 23:45:47,347 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 23:45:47,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 211 [2024-11-13 23:45:47,678 INFO L349 Elim1Store]: treesize reduction 202, result has 20.8 percent of original size [2024-11-13 23:45:47,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 256 treesize of output 308 [2024-11-13 23:45:47,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:47,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 77 [2024-11-13 23:45:48,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:48,657 INFO L349 Elim1Store]: treesize reduction 244, result has 17.0 percent of original size [2024-11-13 23:45:48,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 246 treesize of output 354 [2024-11-13 23:45:48,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:48,859 INFO L349 Elim1Store]: treesize reduction 146, result has 8.2 percent of original size [2024-11-13 23:45:48,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 230 treesize of output 281 [2024-11-13 23:45:48,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:45:48,977 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 23:45:48,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 124 [2024-11-13 23:45:49,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:49,066 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:45:49,067 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:45:49,182 INFO L349 Elim1Store]: treesize reduction 226, result has 2.2 percent of original size [2024-11-13 23:45:49,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 255 treesize of output 279 [2024-11-13 23:45:49,290 INFO L349 Elim1Store]: treesize reduction 17, result has 55.3 percent of original size [2024-11-13 23:45:49,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 60 treesize of output 83 [2024-11-13 23:45:49,437 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 23:45:49,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2024-11-13 23:45:49,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:49,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:49,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:45:49,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 186 [2024-11-13 23:45:49,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-13 23:45:53,214 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-13 23:45:53,275 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:45:53,283 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-13 23:45:53,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 9 [2024-11-13 23:45:53,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:53,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:53,825 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2024-11-13 23:45:53,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 137 [2024-11-13 23:45:53,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:54,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 56 [2024-11-13 23:45:55,534 INFO L349 Elim1Store]: treesize reduction 58, result has 15.9 percent of original size [2024-11-13 23:45:55,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 192 treesize of output 205 [2024-11-13 23:45:56,027 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 23:45:56,028 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 3 case distinctions, treesize of input 49 treesize of output 38 [2024-11-13 23:45:56,310 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 23:45:56,310 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 3 case distinctions, treesize of input 49 treesize of output 38 [2024-11-13 23:45:57,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:45:57,323 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 19 treesize of output 23 [2024-11-13 23:45:57,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:45:57,448 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 19 treesize of output 23 [2024-11-13 23:45:57,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:45:57,579 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 19 treesize of output 23 [2024-11-13 23:45:57,777 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 23:45:57,777 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 3 case distinctions, treesize of input 49 treesize of output 38 [2024-11-13 23:45:57,967 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 23:45:57,968 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 3 case distinctions, treesize of input 49 treesize of output 38 [2024-11-13 23:45:58,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:45:58,779 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 19 treesize of output 23 [2024-11-13 23:45:58,787 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 27 treesize of output 14 [2024-11-13 23:45:58,863 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 27 treesize of output 14 [2024-11-13 23:45:59,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:59,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:59,223 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-13 23:45:59,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 181 [2024-11-13 23:45:59,233 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 9 treesize of output 7 [2024-11-13 23:45:59,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:59,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:45:59,282 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-13 23:45:59,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 91 [2024-11-13 23:47:42,254 WARN L286 SmtUtils]: Spent 1.62m on a formula simplification. DAG size of input: 2389 DAG size of output: 289 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 23:47:42,254 INFO L349 Elim1Store]: treesize reduction 7320, result has 7.2 percent of original size [2024-11-13 23:47:42,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 10 stores, 23 select indices, 23 select index equivalence classes, 0 disjoint index pairs (out of 253 index pairs), introduced 37 new quantified variables, introduced 478 case distinctions, treesize of input 2013 treesize of output 3165 [2024-11-13 23:47:45,680 INFO L224 Elim1Store]: Index analysis took 2033 ms [2024-11-13 23:47:51,402 WARN L286 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 23:47:51,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:47:51,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 2046 treesize of output 2104 [2024-11-13 23:47:56,400 INFO L224 Elim1Store]: Index analysis took 3470 ms [2024-11-13 23:48:17,274 WARN L286 SmtUtils]: Spent 20.87s on a formula simplification. DAG size of input: 245 DAG size of output: 209 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 23:48:17,274 INFO L349 Elim1Store]: treesize reduction 88, result has 80.9 percent of original size [2024-11-13 23:48:17,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 1452 treesize of output 1732 [2024-11-13 23:48:18,014 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 922 treesize of output 925 [2024-11-13 23:48:22,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 7 treesize of output 5 [2024-11-13 23:48:34,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:48:34,883 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 37 treesize of output 33 [2024-11-13 23:48:46,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:48:46,004 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 37 treesize of output 33 [2024-11-13 23:48:47,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:48:47,573 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 37 treesize of output 33 [2024-11-13 23:48:58,929 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-13 23:48:58,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:48:59,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:48:59,402 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-13 23:49:04,507 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse30 (< |c_#StackHeapBarrier| (+ 1 |c_ULTIMATE.start_main_~x~0#1.base|))) (.cse31 (= 0 |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse34 (store |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base| 1)) (.cse29 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0))) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (not (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_49) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_50) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~x~0#1.base|))) (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse1))) (forall ((v_ArrVal_338 Int) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)))) (store (store .cse6 |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_79) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select .cse6 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0))))) (let ((.cse5 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int))) (= (select (select .cse2 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_80) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_81) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) .cse5) 0)) (= .cse5 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)))) (forall ((v_ArrVal_335 Int) (|v_ULTIMATE.start_main_~x~0#1.base_68| Int) (v_DerPreprocessor_108 (Array Int Int))) (or (forall ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_70) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_71))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= v_DerPreprocessor_70 .cse8)) (= (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) 2) (not (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse8 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse8)))))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_77 (Array Int Int)) (v_ArrVal_338 Int) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_78))) (select (select .cse11 .cse12) (select (select .cse11 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) 0) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse12)))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_97 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_98) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= (select (let ((.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_97))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) .cse14) 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse14)))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (not (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_59) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_60) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~x~0#1.base|))) (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse15 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse15))) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0) (forall ((v_DerPreprocessor_102 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse16 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)))) (store (store .cse18 |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_102) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select .cse18 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= .cse16 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_103 (Array Int Int)) (v_DerPreprocessor_104 (Array Int Int))) (= (select (let ((.cse17 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_103) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_104))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) .cse16) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (not (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_59) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_60) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~x~0#1.base|))) (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse19 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse19))) (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_103 (Array Int Int)) (v_DerPreprocessor_104 (Array Int Int)) (v_DerPreprocessor_102 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse20 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_103) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_104))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= (select (select .cse20 .cse21) (select (select (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)))) (store (store .cse22 |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_102) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select .cse22 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) 0) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse21))))) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (let ((.cse24 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_72) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_73) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_74))) (or (not (let ((.cse23 (select .cse24 |c_ULTIMATE.start_main_~x~0#1.base|))) (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse23 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse23))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_89) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_90) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~head~0#1.base|)) (= 2 (select (select .cse24 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0)))))) (forall ((v_ArrVal_335 Int) (|v_ULTIMATE.start_main_~x~0#1.base_68| Int) (v_DerPreprocessor_108 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_DerPreprocessor_69 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_69) |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) 2)))) (or (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse25 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_95) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_96))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= (select (select .cse25 .cse26) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_94) |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338) 0 0)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) 0) (= .cse26 |c_ULTIMATE.start_main_~head~0#1.base|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (forall ((v_DerPreprocessor_94 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_94) |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338) 0 0)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (forall ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int))) (= (select (let ((.cse27 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_95) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_96))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) .cse28) 0)) (= .cse28 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0))))) .cse29 .cse30 .cse31) (or .cse29 (and (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (forall ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse33 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_100) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_101))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= .cse32 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select (select .cse33 .cse32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_99) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) 0))))) (not (= (select .cse34 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0)) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (forall ((v_DerPreprocessor_99 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_99) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (forall ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int))) (= (select (let ((.cse35 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_100) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_101))) (select .cse35 (select (select .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) .cse36) 0)) (= .cse36 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (select .cse34 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0)) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int) (v_DerPreprocessor_109 (Array Int Int)) (v_ArrVal_338 Int)) (or (forall ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int))) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_70) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_71))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= v_DerPreprocessor_70 .cse37)) (= (select (select .cse38 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) 2) (not (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse37 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse37)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int) (v_DerPreprocessor_109 (Array Int Int)) (v_ArrVal_338 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_DerPreprocessor_69 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_69) |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) 2)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)))) (or .cse29 (and (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (forall ((v_DerPreprocessor_82 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse39 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_82) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0)))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (forall ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (= (select (select .cse39 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_83) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_84) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) .cse40) 0)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse40))))) (not (= (select .cse34 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0)) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (forall ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_83) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_84) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse41) (= (let ((.cse42 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_82) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0)))) (select (select .cse42 .cse41) (select (select .cse42 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) 0)))) (not (= (select .cse34 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0)) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int)) (v_ArrVal_338 Int) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse44 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_80) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_81) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= (let ((.cse43 (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)))) (store (store .cse45 |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_79) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select .cse45 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0))))) (select (select .cse43 .cse44) (select (select .cse43 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) 0) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse44)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (not (let ((.cse46 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_49) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_50) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~x~0#1.base|))) (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse46 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse46))) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_97 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse48 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_97))) (let ((.cse47 (select (select .cse48 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse47) (= (select (select .cse48 .cse47) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_98) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) 0))))))) (or .cse29 .cse30 (and (forall ((v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_92 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_92) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (= 2 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_75) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)))) (forall ((v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_91 (Array Int Int)) (v_ArrVal_338 Int)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_91) |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338) 0 0)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (= 2 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_75) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~head~0#1.base|) .cse10))))) .cse31) (or .cse29 .cse30 .cse31 (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_86) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= .cse49 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_DerPreprocessor_85 (Array Int Int)) (v_ArrVal_338 Int)) (= (let ((.cse50 (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_85) |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338) 0 0)))) (select (select .cse50 .cse49) (select (select .cse50 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) 0))))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_DerPreprocessor_85 (Array Int Int)) (v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse52 (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_85) |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338) 0 0)))) (let ((.cse51 (select (select .cse52 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse51) (= (select (select .cse52 (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_86) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) .cse51) 0))))))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (let ((.cse54 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_72) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_73) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_74))) (or (not (let ((.cse53 (select .cse54 |c_ULTIMATE.start_main_~x~0#1.base|))) (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse53 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse53))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (= 2 (select (select .cse54 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (forall ((v_DerPreprocessor_88 (Array Int Int)) (v_ArrVal_338 Int)) (= (select (select (let ((.cse55 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)))) (store (store .cse55 |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_88) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select .cse55 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)))) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int) (v_DerPreprocessor_67 (Array Int Int)) (v_DerPreprocessor_68 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_67) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_68) |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) 2) (forall ((v_DerPreprocessor_105 (Array Int Int)) (v_ArrVal_338 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_105) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (not (= (select .cse34 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0)) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int) (v_DerPreprocessor_67 (Array Int Int)) (v_DerPreprocessor_68 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_67) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_68) |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) 2) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (forall ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_106) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select .cse34 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0)) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0)))) .cse29) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_77 (Array Int Int)) (v_ArrVal_338 Int) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse56 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_78))) (let ((.cse57 (select (select .cse56 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= (select (select .cse56 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) .cse57) 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse57))))))))) is different from true [2024-11-13 23:49:05,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 23:49:05,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740805231] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:49:05,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [379591323] [2024-11-13 23:49:05,554 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-13 23:49:05,555 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:49:05,558 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:49:05,566 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:49:05,566 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:49:14,059 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:49:39,165 WARN L286 SmtUtils]: Spent 16.24s on a formula simplification that was a NOOP. DAG size: 375 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:49:42,404 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '198#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0))' at error location [2024-11-13 23:49:42,404 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:49:42,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:49:42,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-13 23:49:42,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37287193] [2024-11-13 23:49:42,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:49:42,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 23:49:42,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:49:42,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 23:49:42,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=4, NotChecked=28, Total=272 [2024-11-13 23:49:42,406 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:49:44,508 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 [0] [2024-11-13 23:49:46,522 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 [0] [2024-11-13 23:49:48,574 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse30 (< |c_#StackHeapBarrier| (+ 1 |c_ULTIMATE.start_main_~x~0#1.base|))) (.cse31 (= 0 |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse34 (store |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base| 1)) (.cse29 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0))) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (not (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_49) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_50) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~x~0#1.base|))) (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse1))) (forall ((v_ArrVal_338 Int) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)))) (store (store .cse6 |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_79) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select .cse6 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0))))) (let ((.cse5 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int))) (= (select (select .cse2 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_80) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_81) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) .cse5) 0)) (= .cse5 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (forall ((v_ArrVal_335 Int) (|v_ULTIMATE.start_main_~x~0#1.base_68| Int) (v_DerPreprocessor_108 (Array Int Int))) (or (forall ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_70) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_71))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= v_DerPreprocessor_70 .cse8)) (= (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) 2) (not (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse8 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse8)))))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_77 (Array Int Int)) (v_ArrVal_338 Int) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_78))) (select (select .cse11 .cse12) (select (select .cse11 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) 0) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse12)))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_97 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_98) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= (select (let ((.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_97))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) .cse14) 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse14)))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (not (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_59) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_60) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~x~0#1.base|))) (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse15 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse15))) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0) (forall ((v_DerPreprocessor_102 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse16 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)))) (store (store .cse18 |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_102) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select .cse18 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= .cse16 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_103 (Array Int Int)) (v_DerPreprocessor_104 (Array Int Int))) (= (select (let ((.cse17 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_103) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_104))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) .cse16) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (not (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_59) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_60) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~x~0#1.base|))) (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse19 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse19))) (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_103 (Array Int Int)) (v_DerPreprocessor_104 (Array Int Int)) (v_DerPreprocessor_102 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse20 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_103) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_104))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= (select (select .cse20 .cse21) (select (select (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)))) (store (store .cse22 |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_102) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select .cse22 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) 0) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse21))))) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (let ((.cse24 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_72) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_73) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_74))) (or (not (let ((.cse23 (select .cse24 |c_ULTIMATE.start_main_~x~0#1.base|))) (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse23 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse23))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_89) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_90) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~head~0#1.base|)) (= 2 (select (select .cse24 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0)))))) (forall ((v_ArrVal_335 Int) (|v_ULTIMATE.start_main_~x~0#1.base_68| Int) (v_DerPreprocessor_108 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_DerPreprocessor_69 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_69) |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) 2)))) (or (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse25 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_95) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_96))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= (select (select .cse25 .cse26) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_94) |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338) 0 0)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) 0) (= .cse26 |c_ULTIMATE.start_main_~head~0#1.base|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (forall ((v_DerPreprocessor_94 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_94) |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338) 0 0)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (forall ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int))) (= (select (let ((.cse27 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_95) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_96))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) .cse28) 0)) (= .cse28 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0))))) .cse29 .cse30 .cse31) (or .cse29 (and (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (forall ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse33 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_100) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_101))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= .cse32 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select (select .cse33 .cse32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_99) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) 0))))) (not (= (select .cse34 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0)) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (forall ((v_DerPreprocessor_99 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_99) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (forall ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int))) (= (select (let ((.cse35 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_100) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_101))) (select .cse35 (select (select .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) .cse36) 0)) (= .cse36 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (select .cse34 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0)) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int) (v_DerPreprocessor_109 (Array Int Int)) (v_ArrVal_338 Int)) (or (forall ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int))) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_70) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_71))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= v_DerPreprocessor_70 .cse37)) (= (select (select .cse38 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) 2) (not (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse37 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse37)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int) (v_DerPreprocessor_109 (Array Int Int)) (v_ArrVal_338 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_DerPreprocessor_69 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_69) |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) 2)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)))) (or .cse29 (and (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (forall ((v_DerPreprocessor_82 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse39 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_82) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0)))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (forall ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (= (select (select .cse39 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_83) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_84) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) .cse40) 0)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse40))))) (not (= (select .cse34 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0)) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (forall ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_83) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_84) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse41) (= (let ((.cse42 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_82) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0)))) (select (select .cse42 .cse41) (select (select .cse42 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) 0)))) (not (= (select .cse34 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0)) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (or (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int)) (v_ArrVal_338 Int) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse44 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_80) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_81) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= (let ((.cse43 (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)))) (store (store .cse45 |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_79) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select .cse45 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0))))) (select (select .cse43 .cse44) (select (select .cse43 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) 0) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse44)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (not (let ((.cse46 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_49) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_50) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~x~0#1.base|))) (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse46 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse46))) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)))) (let ((.cse47 (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1)) (.cse48 (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 4))) (.cse49 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) 4))) (or (and .cse47 .cse48 (= .cse49 |c_ULTIMATE.start_main_~head~0#1.base|)) (and (<= (+ .cse49 1) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| .cse49) 0) 0) (= (select |c_#valid| .cse49) 1) (= (select (select |c_#memory_$Pointer$.base| .cse49) 0) 0) .cse47 (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) 8)) .cse48 (not (= .cse49 0))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_97 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse51 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_97))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse50) (= (select (select .cse51 .cse50) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_98) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) 0))))))) (or .cse29 .cse30 (and (forall ((v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_92 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_92) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (= 2 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_75) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)))) (forall ((v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_91 (Array Int Int)) (v_ArrVal_338 Int)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_91) |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338) 0 0)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (= 2 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_75) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~head~0#1.base|) .cse10))))) .cse31) (or .cse29 .cse30 .cse31 (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_86) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= .cse52 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_DerPreprocessor_85 (Array Int Int)) (v_ArrVal_338 Int)) (= (let ((.cse53 (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_85) |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338) 0 0)))) (select (select .cse53 .cse52) (select (select .cse53 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) 0))))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_DerPreprocessor_85 (Array Int Int)) (v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse55 (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_85) |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338) 0 0)))) (let ((.cse54 (select (select .cse55 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse54) (= (select (select .cse55 (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_86) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) .cse54) 0))))))))) (let ((.cse59 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse56 (select .cse3 .cse59))) (let ((.cse58 (= .cse56 |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse57 (select .cse7 .cse59))) (or (and (= 2 (select .cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (= (select (select |c_#memory_$Pointer$.offset| .cse56) 0) 0) (= .cse57 0) (not .cse58) (= (select (select |c_#memory_$Pointer$.base| .cse56) 0) 0)) (and .cse58 (= |c_ULTIMATE.start_main_~x~0#1.offset| .cse57)))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_68| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int)) (let ((.cse61 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_72) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_73) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_74))) (or (not (let ((.cse60 (select .cse61 |c_ULTIMATE.start_main_~x~0#1.base|))) (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse60 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse60))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (= 2 (select (select .cse61 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (forall ((v_DerPreprocessor_88 (Array Int Int)) (v_ArrVal_338 Int)) (= (select (select (let ((.cse62 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)))) (store (store .cse62 |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_88) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select .cse62 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)))) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int) (v_DerPreprocessor_67 (Array Int Int)) (v_DerPreprocessor_68 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_67) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_68) |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) 2) (forall ((v_DerPreprocessor_105 (Array Int Int)) (v_ArrVal_338 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_105) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0 0)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (not (= (select .cse34 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0)) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_28| Int) (v_DerPreprocessor_67 (Array Int Int)) (v_DerPreprocessor_68 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_67) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_68) |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) 2) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 1)) (forall ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_106) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select .cse34 |v_ULTIMATE.start_main_#t~malloc10#1.base_28|) 0)) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_28| 0)))) .cse29) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_68| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_68|) 0)) (forall ((v_ArrVal_335 Int) (v_DerPreprocessor_77 (Array Int Int)) (v_ArrVal_338 Int) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse63 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_78))) (let ((.cse64 (select (select .cse63 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (= (select (select .cse63 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335)) |v_ULTIMATE.start_main_~x~0#1.base_68| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) .cse64) 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse64))))))))) is different from true [2024-11-13 23:49:53,468 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 [0] [2024-11-13 23:49:57,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:01,099 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 [0] [2024-11-13 23:50:08,123 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 [0] [2024-11-13 23:50:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:50:15,156 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-11-13 23:50:15,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 23:50:15,158 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-13 23:50:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:50:15,158 INFO L225 Difference]: With dead ends: 43 [2024-11-13 23:50:15,158 INFO L226 Difference]: Without dead ends: 41 [2024-11-13 23:50:15,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 49.1s TimeCoverageRelationStatistics Valid=93, Invalid=323, Unknown=12, NotChecked=78, Total=506 [2024-11-13 23:50:15,160 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2024-11-13 23:50:15,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 84 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 13 Unknown, 47 Unchecked, 15.8s Time] [2024-11-13 23:50:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-13 23:50:15,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 19. [2024-11-13 23:50:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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-13 23:50:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-13 23:50:15,177 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2024-11-13 23:50:15,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:50:15,177 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-13 23:50:15,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:50:15,178 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-13 23:50:15,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 23:50:15,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:50:15,178 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:50:15,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 23:50:15,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:50:15,379 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:50:15,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:50:15,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1993058898, now seen corresponding path program 2 times [2024-11-13 23:50:15,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:50:15,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988836135] [2024-11-13 23:50:15,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:50:15,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:50:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:50:23,550 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-13 23:50:23,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:50:23,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988836135] [2024-11-13 23:50:23,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988836135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:50:23,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956987151] [2024-11-13 23:50:23,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 23:50:23,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:50:23,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:50:23,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:50:23,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 23:50:24,820 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 23:50:24,820 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:50:24,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-13 23:50:24,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:50:24,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 103 [2024-11-13 23:50:24,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 97 [2024-11-13 23:50:24,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 91 [2024-11-13 23:50:25,020 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-13 23:50:25,130 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-13 23:50:25,147 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-13 23:50:25,167 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 11 treesize of output 7 [2024-11-13 23:50:25,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2024-11-13 23:50:25,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2024-11-13 23:50:25,221 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-13 23:50:25,244 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-13 23:50:25,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-11-13 23:50:25,321 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-13 23:50:25,327 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-13 23:50:25,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2024-11-13 23:50:25,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:50:25,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2024-11-13 23:50:25,385 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-13 23:50:25,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:50:25,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2024-11-13 23:50:25,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:50:25,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-13 23:50:25,477 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 12 treesize of output 11 [2024-11-13 23:50:25,503 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2024-11-13 23:50:25,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:50:25,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 23:50:25,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:50:25,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-11-13 23:50:25,552 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 12 treesize of output 11 [2024-11-13 23:50:25,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:50:25,902 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 375 treesize of output 361 [2024-11-13 23:50:25,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:50:26,026 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-11-13 23:50:26,027 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 351 treesize of output 348 [2024-11-13 23:50:26,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:50:26,146 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-13 23:50:26,146 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 342 treesize of output 318 [2024-11-13 23:50:26,261 INFO L349 Elim1Store]: treesize reduction 160, result has 8.6 percent of original size [2024-11-13 23:50:26,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 310 treesize of output 344 [2024-11-13 23:50:26,382 INFO L349 Elim1Store]: treesize reduction 112, result has 8.9 percent of original size [2024-11-13 23:50:26,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 324 treesize of output 349 [2024-11-13 23:50:26,494 INFO L349 Elim1Store]: treesize reduction 53, result has 8.6 percent of original size [2024-11-13 23:50:26,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 269 treesize of output 302 [2024-11-13 23:50:26,590 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 23:50:26,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 210 [2024-11-13 23:50:27,039 INFO L349 Elim1Store]: treesize reduction 206, result has 19.2 percent of original size [2024-11-13 23:50:27,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 257 treesize of output 305 [2024-11-13 23:50:28,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 23:50:28,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 23:50:29,102 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2024-11-13 23:50:29,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:50:29,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2024-11-13 23:50:29,557 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 8 treesize of output 1 [2024-11-13 23:50:29,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:50:29,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:50:30,330 INFO L349 Elim1Store]: treesize reduction 78, result has 31.6 percent of original size [2024-11-13 23:50:30,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 case distinctions, treesize of input 34 treesize of output 53 [2024-11-13 23:50:30,558 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-13 23:50:30,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 33 [2024-11-13 23:50:30,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 309 treesize of output 311 [2024-11-13 23:50:30,683 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 328 treesize of output 315 [2024-11-13 23:50:30,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:50:30,847 INFO L349 Elim1Store]: treesize reduction 152, result has 11.1 percent of original size [2024-11-13 23:50:30,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 286 treesize of output 348 [2024-11-13 23:50:31,325 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 7 treesize of output 3 [2024-11-13 23:50:31,570 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:50:31,623 INFO L349 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2024-11-13 23:50:31,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 48 [2024-11-13 23:50:31,919 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2024-11-13 23:50:31,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 34 [2024-11-13 23:50:33,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2024-11-13 23:50:34,557 INFO L349 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2024-11-13 23:50:34,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 18 [2024-11-13 23:50:34,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 886 treesize of output 1042 [2024-11-13 23:50:35,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:50:35,444 INFO L349 Elim1Store]: treesize reduction 126, result has 15.4 percent of original size [2024-11-13 23:50:35,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 1120 treesize of output 1308 [2024-11-13 23:50:35,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 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 53 treesize of output 81 [2024-11-13 23:50:38,506 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 8 treesize of output 4 [2024-11-13 23:50:39,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2024-11-13 23:50:39,499 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 12 treesize of output 1 [2024-11-13 23:50:39,697 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 12 treesize of output 1 [2024-11-13 23:50:40,152 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 12 treesize of output 1 [2024-11-13 23:50:42,932 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no need to replace index [2024-11-13 23:50:42,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1829574387] [2024-11-13 23:50:42,936 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-13 23:50:42,936 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:50:42,937 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:50:42,937 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:50:42,937 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:50:42,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 23:50:43,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:50:43,153 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@52c98ead at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertScriptNotLocked(ManagedScript.java:109) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:282) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminateLight(PartialQuantifierElimination.java:62) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$TermDomainOperationProviderWithLightElimination.newQuantifier(SymbolicTools.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$TermDomainOperationProviderWithLightElimination.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:114) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-13 23:50:43,163 INFO L158 Benchmark]: Toolchain (without parser) took 306786.78ms. Allocated memory was 117.4MB in the beginning and 696.3MB in the end (delta: 578.8MB). Free memory was 91.6MB in the beginning and 438.7MB in the end (delta: -347.1MB). Peak memory consumption was 231.6MB. Max. memory is 16.1GB. [2024-11-13 23:50:43,164 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:50:43,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.64ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 74.1MB in the end (delta: 17.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:50:43,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.69ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 72.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:50:43,164 INFO L158 Benchmark]: Boogie Preprocessor took 28.39ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 70.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:50:43,164 INFO L158 Benchmark]: RCFGBuilder took 815.34ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 42.5MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 23:50:43,165 INFO L158 Benchmark]: TraceAbstraction took 305355.71ms. Allocated memory was 117.4MB in the beginning and 696.3MB in the end (delta: 578.8MB). Free memory was 42.0MB in the beginning and 438.7MB in the end (delta: -396.7MB). Peak memory consumption was 189.7MB. Max. memory is 16.1GB. [2024-11-13 23:50:43,167 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.64ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 74.1MB in the end (delta: 17.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.69ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 72.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.39ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 70.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 815.34ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 42.5MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 305355.71ms. Allocated memory was 117.4MB in the beginning and 696.3MB in the end (delta: 578.8MB). Free memory was 42.0MB in the beginning and 438.7MB in the end (delta: -396.7MB). Peak memory consumption was 189.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@52c98ead de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@52c98ead: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertScriptNotLocked(ManagedScript.java:109) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-13 23:50:43,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-optional-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:50:46,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:50:46,921 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-13 23:50:46,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:50:46,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:50:46,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:50:46,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:50:46,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:50:46,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:50:46,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:50:46,985 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:50:46,985 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:50:46,986 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:50:46,986 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:50:46,986 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:50:46,986 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:50:46,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:50:46,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:50:46,987 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:50:46,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:50:46,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:50:46,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:50:46,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:50:46,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:50:46,987 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:50:46,987 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 23:50:46,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:50:46,987 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 23:50:46,987 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:50:46,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:50:46,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:50:46,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:50:46,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 23:50:46,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:50:46,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:50:46,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:50:46,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:50:46,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:50:46,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:50:46,991 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-13 23:50:46,992 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 23:50:46,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:50:46,992 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:50:46,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E 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 -> 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 -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2024-11-13 23:50:47,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:50:47,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:50:47,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:50:47,329 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:50:47,330 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:50:47,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/forester-heap/sll-optional-1.i Unable to find full path for "g++" [2024-11-13 23:50:49,675 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:50:50,116 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:50:50,117 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/sv-benchmarks/c/forester-heap/sll-optional-1.i [2024-11-13 23:50:50,143 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/data/6ec1b6385/b2be328b4d274290a201ede4fda75e11/FLAG388570bda [2024-11-13 23:50:50,301 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/data/6ec1b6385/b2be328b4d274290a201ede4fda75e11 [2024-11-13 23:50:50,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:50:50,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:50:50,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:50:50,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:50:50,332 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:50:50,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:50:50" (1/1) ... [2024-11-13 23:50:50,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23d4c2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:50:50, skipping insertion in model container [2024-11-13 23:50:50,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:50:50" (1/1) ... [2024-11-13 23:50:50,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:50:50,874 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_8b77d41c-716f-4143-ac12-03c88c775a5c/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2024-11-13 23:50:50,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:50:50,906 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:50:50,989 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_8b77d41c-716f-4143-ac12-03c88c775a5c/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2024-11-13 23:50:50,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:50:51,043 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:50:51,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:50:51 WrapperNode [2024-11-13 23:50:51,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:50:51,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:50:51,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:50:51,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:50:51,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:50:51" (1/1) ... [2024-11-13 23:50:51,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:50:51" (1/1) ... [2024-11-13 23:50:51,126 INFO L138 Inliner]: procedures = 122, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 125 [2024-11-13 23:50:51,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:50:51,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:50:51,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:50:51,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:50:51,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:50:51" (1/1) ... [2024-11-13 23:50:51,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:50:51" (1/1) ... [2024-11-13 23:50:51,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:50:51" (1/1) ... [2024-11-13 23:50:51,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:50:51" (1/1) ... [2024-11-13 23:50:51,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:50:51" (1/1) ... [2024-11-13 23:50:51,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:50:51" (1/1) ... [2024-11-13 23:50:51,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:50:51" (1/1) ... [2024-11-13 23:50:51,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:50:51" (1/1) ... [2024-11-13 23:50:51,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:50:51,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:50:51,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:50:51,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:50:51,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:50:51" (1/1) ... [2024-11-13 23:50:51,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:50:51,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:50:51,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:50:51,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:50:51,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-13 23:50:51,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 23:50:51,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:50:51,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 23:50:51,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 23:50:51,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 23:50:51,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-13 23:50:51,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-13 23:50:51,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:50:51,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:50:51,448 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:50:51,449 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:50:52,306 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-13 23:50:52,306 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:50:52,334 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:50:52,334 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-13 23:50:52,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:50:52 BoogieIcfgContainer [2024-11-13 23:50:52,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:50:52,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:50:52,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:50:52,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:50:52,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:50:50" (1/3) ... [2024-11-13 23:50:52,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44818e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:50:52, skipping insertion in model container [2024-11-13 23:50:52,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:50:51" (2/3) ... [2024-11-13 23:50:52,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44818e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:50:52, skipping insertion in model container [2024-11-13 23:50:52,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:50:52" (3/3) ... [2024-11-13 23:50:52,358 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2024-11-13 23:50:52,395 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:50:52,397 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-optional-1.i that has 1 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-13 23:50:52,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:50:52,479 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f21fd2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:50:52,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 23:50:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:50:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 23:50:52,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:50:52,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:50:52,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:50:52,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:50:52,501 INFO L85 PathProgramCache]: Analyzing trace with hash 860118730, now seen corresponding path program 1 times [2024-11-13 23:50:52,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:50:52,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202786330] [2024-11-13 23:50:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:50:52,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:50:52,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:50:52,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:50:52,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 23:50:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:50:52,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 23:50:52,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:50:52,735 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-13 23:50:52,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:50:52,736 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:50:52,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202786330] [2024-11-13 23:50:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202786330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:50:52,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:50:52,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:50:52,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250937716] [2024-11-13 23:50:52,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:50:52,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 23:50:52,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:50:52,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 23:50:52,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 23:50:52,776 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) 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-13 23:50:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:50:52,794 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2024-11-13 23:50:52,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 23:50:52,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) 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-13 23:50:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:50:52,805 INFO L225 Difference]: With dead ends: 51 [2024-11-13 23:50:52,806 INFO L226 Difference]: Without dead ends: 22 [2024-11-13 23:50:52,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 23:50:52,816 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:50:52,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 23:50:52,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-13 23:50:52,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-13 23:50:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 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-13 23:50:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2024-11-13 23:50:52,867 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2024-11-13 23:50:52,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:50:52,871 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-13 23:50:52,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) 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-13 23:50:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2024-11-13 23:50:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 23:50:52,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:50:52,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:50:52,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-13 23:50:53,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:50:53,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:50:53,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:50:53,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1012406527, now seen corresponding path program 1 times [2024-11-13 23:50:53,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:50:53,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675467252] [2024-11-13 23:50:53,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:50:53,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:50:53,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:50:53,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:50:53,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 23:50:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:50:53,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 23:50:53,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:50:53,248 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-13 23:50:53,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:50:53,249 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:50:53,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675467252] [2024-11-13 23:50:53,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675467252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:50:53,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:50:53,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:50:53,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033740196] [2024-11-13 23:50:53,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:50:53,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:50:53,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:50:53,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:50:53,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:50:53,254 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:50:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:50:53,300 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2024-11-13 23:50:53,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:50:53,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 23:50:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:50:53,304 INFO L225 Difference]: With dead ends: 25 [2024-11-13 23:50:53,304 INFO L226 Difference]: Without dead ends: 23 [2024-11-13 23:50:53,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-13 23:50:53,307 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:50:53,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 23:50:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-13 23:50:53,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-13 23:50:53,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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-13 23:50:53,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-13 23:50:53,317 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2024-11-13 23:50:53,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:50:53,318 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-13 23:50:53,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:50:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-13 23:50:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 23:50:53,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:50:53,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:50:53,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-13 23:50:53,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:50:53,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:50:53,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:50:53,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1012404605, now seen corresponding path program 1 times [2024-11-13 23:50:53,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:50:53,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110623373] [2024-11-13 23:50:53,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:50:53,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:50:53,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:50:53,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:50:53,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 23:50:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:50:53,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 23:50:53,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:50:53,811 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 7 [2024-11-13 23:50:54,021 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-13 23:50:54,022 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 1 case distinctions, treesize of input 43 treesize of output 23 [2024-11-13 23:50:54,072 INFO L349 Elim1Store]: treesize reduction 6, result has 62.5 percent of original size [2024-11-13 23:50:54,072 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 19 treesize of output 19 [2024-11-13 23:50:54,121 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 55 treesize of output 13 [2024-11-13 23:50:54,664 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-13 23:50:54,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:50:54,665 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:50:54,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110623373] [2024-11-13 23:50:54,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110623373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:50:54,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:50:54,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 23:50:54,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721084175] [2024-11-13 23:50:54,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:50:54,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:50:54,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:50:54,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:50:54,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:50:54,668 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:50:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:50:57,144 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2024-11-13 23:50:57,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 23:50:57,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 23:50:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:50:57,146 INFO L225 Difference]: With dead ends: 68 [2024-11-13 23:50:57,146 INFO L226 Difference]: Without dead ends: 55 [2024-11-13 23:50:57,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-13 23:50:57,148 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 99 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:50:57,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 72 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 23:50:57,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-13 23:50:57,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2024-11-13 23:50:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:50:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-11-13 23:50:57,168 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 16 [2024-11-13 23:50:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:50:57,168 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-13 23:50:57,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:50:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-11-13 23:50:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 23:50:57,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:50:57,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:50:57,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-13 23:50:57,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:50:57,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:50:57,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:50:57,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1010557563, now seen corresponding path program 1 times [2024-11-13 23:50:57,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:50:57,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395413179] [2024-11-13 23:50:57,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:50:57,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:50:57,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:50:57,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:50:57,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 23:50:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:50:57,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 23:50:57,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:50:57,924 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-13 23:50:57,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:50:57,925 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:50:57,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395413179] [2024-11-13 23:50:57,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395413179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:50:57,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:50:57,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 23:50:57,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140289894] [2024-11-13 23:50:57,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:50:57,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 23:50:57,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:50:57,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 23:50:57,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:50:57,927 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:51:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:51:00,117 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2024-11-13 23:51:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 23:51:00,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 23:51:00,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:51:00,119 INFO L225 Difference]: With dead ends: 62 [2024-11-13 23:51:00,119 INFO L226 Difference]: Without dead ends: 60 [2024-11-13 23:51:00,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-13 23:51:00,120 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 69 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 23:51:00,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 72 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 23:51:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-13 23:51:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2024-11-13 23:51:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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-13 23:51:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2024-11-13 23:51:00,140 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2024-11-13 23:51:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:51:00,142 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2024-11-13 23:51:00,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:51:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2024-11-13 23:51:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 23:51:00,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:51:00,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:51:00,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-13 23:51:00,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:51:00,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:51:00,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:51:00,346 INFO L85 PathProgramCache]: Analyzing trace with hash 764449799, now seen corresponding path program 1 times [2024-11-13 23:51:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:51:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424270398] [2024-11-13 23:51:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:00,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:51:00,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:51:00,350 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:51:00,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-13 23:51:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:00,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 23:51:00,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:00,490 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 7 [2024-11-13 23:51:00,532 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 37 treesize of output 21 [2024-11-13 23:51:00,538 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 21 treesize of output 9 [2024-11-13 23:51:00,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 23:51:00,649 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-13 23:51:00,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:51:00,650 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:51:00,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424270398] [2024-11-13 23:51:00,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424270398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:51:00,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:51:00,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:51:00,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739856348] [2024-11-13 23:51:00,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:51:00,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:51:00,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:51:00,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:51:00,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:51:00,652 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:51:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:51:02,095 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2024-11-13 23:51:02,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:51:02,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 23:51:02,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:51:02,097 INFO L225 Difference]: With dead ends: 76 [2024-11-13 23:51:02,097 INFO L226 Difference]: Without dead ends: 59 [2024-11-13 23:51:02,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:51:02,098 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 81 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:51:02,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 73 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 23:51:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-13 23:51:02,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2024-11-13 23:51:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 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-13 23:51:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2024-11-13 23:51:02,113 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 16 [2024-11-13 23:51:02,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:51:02,114 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2024-11-13 23:51:02,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:51:02,114 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2024-11-13 23:51:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 23:51:02,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:51:02,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:51:02,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-13 23:51:02,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:51:02,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:51:02,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:51:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash 626110911, now seen corresponding path program 1 times [2024-11-13 23:51:02,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:51:02,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906689699] [2024-11-13 23:51:02,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:02,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:51:02,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:51:02,323 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:51:02,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-13 23:51:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:02,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 23:51:02,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:02,470 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 11 treesize of output 7 [2024-11-13 23:51:02,482 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 11 treesize of output 7 [2024-11-13 23:51:02,690 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-13 23:51:02,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:51:02,690 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:51:02,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906689699] [2024-11-13 23:51:02,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906689699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:51:02,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:51:02,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 23:51:02,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969244376] [2024-11-13 23:51:02,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:51:02,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:51:02,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:51:02,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:51:02,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:51:02,693 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:51:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:51:06,195 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2024-11-13 23:51:06,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 23:51:06,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 23:51:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:51:06,197 INFO L225 Difference]: With dead ends: 95 [2024-11-13 23:51:06,197 INFO L226 Difference]: Without dead ends: 82 [2024-11-13 23:51:06,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-13 23:51:06,199 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 69 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:51:06,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 118 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-13 23:51:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-13 23:51:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2024-11-13 23:51:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 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-13 23:51:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2024-11-13 23:51:06,224 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 17 [2024-11-13 23:51:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:51:06,225 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-11-13 23:51:06,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:51:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-11-13 23:51:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 23:51:06,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:51:06,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:51:06,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-13 23:51:06,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:51:06,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:51:06,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:51:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1892001981, now seen corresponding path program 1 times [2024-11-13 23:51:06,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:51:06,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557392036] [2024-11-13 23:51:06,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:06,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:51:06,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:51:06,439 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:51:06,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-13 23:51:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:06,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 23:51:06,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:06,581 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 11 treesize of output 7 [2024-11-13 23:51:06,594 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 11 treesize of output 7 [2024-11-13 23:51:06,856 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-13 23:51:06,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:51:06,856 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:51:06,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557392036] [2024-11-13 23:51:06,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557392036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:51:06,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:51:06,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:51:06,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566909941] [2024-11-13 23:51:06,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:51:06,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:51:06,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:51:06,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:51:06,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:51:06,858 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:51:08,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:51:08,486 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2024-11-13 23:51:08,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:51:08,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 23:51:08,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:51:08,487 INFO L225 Difference]: With dead ends: 81 [2024-11-13 23:51:08,487 INFO L226 Difference]: Without dead ends: 79 [2024-11-13 23:51:08,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-13 23:51:08,489 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 65 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:51:08,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 97 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 23:51:08,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-13 23:51:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 51. [2024-11-13 23:51:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 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-13 23:51:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2024-11-13 23:51:08,503 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 17 [2024-11-13 23:51:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:51:08,503 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-11-13 23:51:08,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:51:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-11-13 23:51:08,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 23:51:08,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:51:08,505 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:51:08,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-13 23:51:08,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:51:08,709 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:51:08,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:51:08,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2055357088, now seen corresponding path program 1 times [2024-11-13 23:51:08,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:51:08,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402683386] [2024-11-13 23:51:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:08,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:51:08,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:51:08,717 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:51:08,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-13 23:51:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:08,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 23:51:08,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:08,964 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 7 [2024-11-13 23:51:09,002 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 35 treesize of output 19 [2024-11-13 23:51:09,023 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 43 treesize of output 11 [2024-11-13 23:51:09,067 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-13 23:51:09,068 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 27 treesize of output 35 [2024-11-13 23:51:09,466 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-13 23:51:09,467 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 54 [2024-11-13 23:51:09,489 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-13 23:51:09,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:51:09,546 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-13 23:51:09,547 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2024-11-13 23:51:09,643 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-11-13 23:51:09,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2024-11-13 23:51:09,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-11-13 23:51:09,959 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-13 23:51:09,959 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 92 [2024-11-13 23:51:09,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2024-11-13 23:51:10,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-13 23:51:10,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:51:10,090 INFO L349 Elim1Store]: treesize reduction 97, result has 1.0 percent of original size [2024-11-13 23:51:10,091 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 1 [2024-11-13 23:51:10,706 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-13 23:51:10,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:51:13,471 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))) (.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_24| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_7| (_ BitVec 32)) (v_ArrVal_258 (_ BitVec 1))) (or (not (= (_ bv0 1) (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_24| v_ArrVal_258) |v_ULTIMATE.start_main_#t~malloc10#1.base_7|))) (forall ((v_ArrVal_266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (let ((.cse0 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.base_24| v_ArrVal_265) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_267))) (select (select .cse0 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.base_24|)) |v_ULTIMATE.start_main_~x~0#1.base_24| v_ArrVal_266) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_268) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_24|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_24| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_7| (_ BitVec 32)) (v_ArrVal_258 (_ BitVec 1))) (or (forall ((v_ArrVal_266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.base_24|)) |v_ULTIMATE.start_main_~x~0#1.base_24| v_ArrVal_266) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_268))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (select (select (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.base_24| v_ArrVal_265) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_267) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_24| v_ArrVal_258) |v_ULTIMATE.start_main_#t~malloc10#1.base_7|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_24|))))))) is different from false [2024-11-13 23:51:44,458 WARN L286 SmtUtils]: Spent 29.80s on a formula simplification. DAG size of input: 176 DAG size of output: 131 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 23:51:44,458 INFO L349 Elim1Store]: treesize reduction 2445, result has 35.8 percent of original size [2024-11-13 23:51:44,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 61058 treesize of output 56118 [2024-11-13 23:51:57,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:57,784 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 25804 treesize of output 22832 [2024-11-13 23:51:58,366 INFO L224 Elim1Store]: Index analysis took 137 ms [2024-11-13 23:52:04,701 WARN L286 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 23:52:04,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:52:04,702 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 22768 treesize of output 16764 [2024-11-13 23:53:02,117 WARN L286 SmtUtils]: Spent 56.94s on a formula simplification. DAG size of input: 527 DAG size of output: 257 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 23:53:02,118 INFO L349 Elim1Store]: treesize reduction 2660, result has 28.2 percent of original size [2024-11-13 23:53:02,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 59623 treesize of output 53511 [2024-11-13 23:53:04,081 INFO L224 Elim1Store]: Index analysis took 186 ms [2024-11-13 23:53:05,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:05,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 20192 treesize of output 20070 [2024-11-13 23:53:07,368 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 19319 treesize of output 18871 [2024-11-13 23:53:08,315 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 18871 treesize of output 18647 [2024-11-13 23:53:12,173 INFO L224 Elim1Store]: Index analysis took 359 ms [2024-11-13 23:53:16,098 INFO L349 Elim1Store]: treesize reduction 507, result has 28.2 percent of original size [2024-11-13 23:53:16,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 21 case distinctions, treesize of input 17538 treesize of output 17637 [2024-11-13 23:53:18,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:18,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 17296 treesize of output 17024 [2024-11-13 23:53:20,758 INFO L224 Elim1Store]: Index analysis took 468 ms [2024-11-13 23:53:22,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:22,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 17068 treesize of output 17186 [2024-11-13 23:53:25,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:25,298 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 17014 treesize of output 16688 [2024-11-13 23:53:28,641 INFO L224 Elim1Store]: Index analysis took 298 ms [2024-11-13 23:53:29,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:29,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 27307 treesize of output 27249 [2024-11-13 23:53:33,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:33,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 17618 treesize of output 17388 [2024-11-13 23:53:36,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:36,155 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 17326 treesize of output 16980 [2024-11-13 23:58:55,083 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-13 23:58:55,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-13 23:58:55,084 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:58:55,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402683386] [2024-11-13 23:58:55,085 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2024-11-13 23:58:55,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1365671053] [2024-11-13 23:58:55,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:58:55,085 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:58:55,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:58:55,087 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:58:55,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-13 23:58:55,203 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:320) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:386) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:84) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 42 more [2024-11-13 23:58:55,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065505535] [2024-11-13 23:58:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:58:55,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:58:55,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:58:55,218 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:58:55,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 23:58:55,300 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by v_ArrVal_272 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:116) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:320) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:386) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:84) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-13 23:58:55,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:58:55,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2024-11-13 23:58:55,300 ERROR L171 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2024-11-13 23:58:55,300 INFO L325 BasicCegarLoop]: Counterexample might be feasible [2024-11-13 23:58:55,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 23:58:55,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-13 23:58:55,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 23:58:55,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-13 23:58:55,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b77d41c-716f-4143-ac12-03c88c775a5c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-13 23:58:55,916 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:58:55,929 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 23:58:55,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 11:58:55 BoogieIcfgContainer [2024-11-13 23:58:55,933 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 23:58:55,934 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:58:55,934 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:58:55,934 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:58:55,935 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:50:52" (3/4) ... [2024-11-13 23:58:55,938 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 23:58:55,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:58:55,940 INFO L158 Benchmark]: Toolchain (without parser) took 485630.68ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 75.3MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 318.5MB. Max. memory is 16.1GB. [2024-11-13 23:58:55,941 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:58:55,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 728.23ms. Allocated memory is still 100.7MB. Free memory was 75.1MB in the beginning and 56.7MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 23:58:55,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.47ms. Allocated memory is still 100.7MB. Free memory was 56.5MB in the beginning and 54.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:58:55,941 INFO L158 Benchmark]: Boogie Preprocessor took 69.99ms. Allocated memory is still 100.7MB. Free memory was 54.8MB in the beginning and 53.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:58:55,942 INFO L158 Benchmark]: RCFGBuilder took 1133.40ms. Allocated memory is still 100.7MB. Free memory was 53.1MB in the beginning and 72.1MB in the end (delta: -19.0MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-13 23:58:55,942 INFO L158 Benchmark]: TraceAbstraction took 483590.79ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 71.2MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 942.8MB. Max. memory is 16.1GB. [2024-11-13 23:58:55,942 INFO L158 Benchmark]: Witness Printer took 5.23ms. Allocated memory is still 1.6GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:58:55,944 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 728.23ms. Allocated memory is still 100.7MB. Free memory was 75.1MB in the beginning and 56.7MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.47ms. Allocated memory is still 100.7MB. Free memory was 56.5MB in the beginning and 54.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.99ms. Allocated memory is still 100.7MB. Free memory was 54.8MB in the beginning and 53.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1133.40ms. Allocated memory is still 100.7MB. Free memory was 53.1MB in the beginning and 72.1MB in the end (delta: -19.0MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * TraceAbstraction took 483590.79ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 71.2MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 942.8MB. Max. memory is 16.1GB. * Witness Printer took 5.23ms. Allocated memory is still 1.6GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1007]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = ((void*)0) [L998] COND TRUE __VERIFIER_nondet_int() [L998] head->data = 2 [L998] head->opt = malloc(sizeof(SLL)) [L998] EXPR head->opt [L998] head->opt->next = ((void*)0) [L999] SLL* x = head; [L1001] COND TRUE __VERIFIER_nondet_int() [L1001] x->next = malloc(sizeof(SLL)) [L1001] EXPR x->next [L1001] x = x->next [L1001] x->next = ((void*)0) [L1001] COND TRUE __VERIFIER_nondet_int() [L1001] x->data = 2 [L1001] x->opt = malloc(sizeof(SLL)) [L1001] EXPR x->opt [L1001] x->opt->next = ((void*)0) [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1004] x = head [L1005] COND TRUE x != ((void*)0) [L1007] EXPR x->data [L1007] EXPR x->data == 2 && x->opt != x [L1007] EXPR x->opt [L1007] EXPR x->data == 2 && x->opt != x [L1007] EXPR x->data == 2 && x->opt != x && x->opt->next == ((void*)0) [L1007] EXPR x->opt [L1007] EXPR x->opt->next [L1007] EXPR x->data == 2 && x->opt != x && x->opt->next == ((void*)0) [L1007] EXPR (x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x [L1007] EXPR x->opt [L1007] EXPR (x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x [L1007] COND TRUE !((x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x) [L1007] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 483.5s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 383 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 383 mSDsluCounter, 525 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 341 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 499 IncrementalHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 184 mSDtfsCounter, 499 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=6, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 115 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 468.3s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 1851 SizeOfPredicates, 36 NumberOfNonLiveVariables, 691 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 0/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN