./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/sina2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/sina2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ea1eb4a8af9eb0da04a9f2b25d1b98ecd98ff3b6d87ba0d8e53000f12b8adcc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:51:46,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:51:46,920 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:51:46,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:51:46,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:51:46,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:51:46,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:51:46,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:51:46,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:51:46,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:51:46,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:51:46,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:51:46,964 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:51:46,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:51:46,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:51:46,966 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:51:46,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:51:46,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:51:46,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:51:46,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:51:46,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:51:46,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:51:46,969 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:51:46,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:51:46,970 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:51:46,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:51:46,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:51:46,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:51:46,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:51:46,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:51:46,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:51:46,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:51:46,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:51:46,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:51:46,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:51:46,975 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:51:46,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:51:46,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:51:46,975 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:51:46,976 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ea1eb4a8af9eb0da04a9f2b25d1b98ecd98ff3b6d87ba0d8e53000f12b8adcc [2023-11-06 22:51:47,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:51:47,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:51:47,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:51:47,306 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:51:47,306 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:51:47,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/array-fpi/sina2.c [2023-11-06 22:51:50,433 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:51:50,715 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:51:50,715 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/sv-benchmarks/c/array-fpi/sina2.c [2023-11-06 22:51:50,726 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/data/27c185734/15f733b49bcb4c2c91ffbcf822412d95/FLAG7b619b86a [2023-11-06 22:51:50,738 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/data/27c185734/15f733b49bcb4c2c91ffbcf822412d95 [2023-11-06 22:51:50,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:51:50,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:51:50,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:51:50,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:51:50,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:51:50,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:50" (1/1) ... [2023-11-06 22:51:50,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40aee80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:50, skipping insertion in model container [2023-11-06 22:51:50,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:50" (1/1) ... [2023-11-06 22:51:50,775 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:51:50,927 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/sv-benchmarks/c/array-fpi/sina2.c[588,601] [2023-11-06 22:51:50,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:51:50,956 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:51:50,969 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/sv-benchmarks/c/array-fpi/sina2.c[588,601] [2023-11-06 22:51:50,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:51:50,992 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:51:50,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:50 WrapperNode [2023-11-06 22:51:50,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:51:50,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:51:50,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:51:50,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:51:51,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:50" (1/1) ... [2023-11-06 22:51:51,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:50" (1/1) ... [2023-11-06 22:51:51,032 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 92 [2023-11-06 22:51:51,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:51:51,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:51:51,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:51:51,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:51:51,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:50" (1/1) ... [2023-11-06 22:51:51,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:50" (1/1) ... [2023-11-06 22:51:51,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:50" (1/1) ... [2023-11-06 22:51:51,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:50" (1/1) ... [2023-11-06 22:51:51,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:50" (1/1) ... [2023-11-06 22:51:51,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:50" (1/1) ... [2023-11-06 22:51:51,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:50" (1/1) ... [2023-11-06 22:51:51,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:50" (1/1) ... [2023-11-06 22:51:51,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:51:51,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:51:51,082 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:51:51,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:51:51,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:50" (1/1) ... [2023-11-06 22:51:51,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:51:51,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:51,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:51,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:51:51,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:51:51,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:51:51,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:51:51,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:51:51,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:51:51,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:51:51,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:51:51,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:51:51,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:51:51,271 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:51:51,274 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:51:51,508 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:51:51,514 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:51:51,515 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 22:51:51,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:51 BoogieIcfgContainer [2023-11-06 22:51:51,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:51:51,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:51:51,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:51:51,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:51:51,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:51:50" (1/3) ... [2023-11-06 22:51:51,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afcaa6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:51, skipping insertion in model container [2023-11-06 22:51:51,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:50" (2/3) ... [2023-11-06 22:51:51,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afcaa6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:51, skipping insertion in model container [2023-11-06 22:51:51,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:51" (3/3) ... [2023-11-06 22:51:51,527 INFO L112 eAbstractionObserver]: Analyzing ICFG sina2.c [2023-11-06 22:51:51,547 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:51:51,548 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:51:51,599 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:51:51,606 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@6f4d4964, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:51:51,606 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:51:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:51:51,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:51,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:51,619 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:51,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:51,624 INFO L85 PathProgramCache]: Analyzing trace with hash -592971038, now seen corresponding path program 1 times [2023-11-06 22:51:51,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:51,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946166069] [2023-11-06 22:51:51,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:51,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:51,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:51,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946166069] [2023-11-06 22:51:51,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946166069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:51,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:51,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:51:51,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362694780] [2023-11-06 22:51:51,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:51,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:51:51,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:51,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:51:51,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:51:51,859 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:51,876 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2023-11-06 22:51:51,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:51:51,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-06 22:51:51,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:51,884 INFO L225 Difference]: With dead ends: 44 [2023-11-06 22:51:51,885 INFO L226 Difference]: Without dead ends: 20 [2023-11-06 22:51:51,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:51:51,891 INFO L413 NwaCegarLoop]: 28 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, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:51,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:51,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-06 22:51:51,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-06 22:51:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-11-06 22:51:51,921 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2023-11-06 22:51:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:51,922 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-11-06 22:51:51,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:51,922 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-11-06 22:51:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:51:51,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:51,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:51,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:51:51,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:51,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:51,925 INFO L85 PathProgramCache]: Analyzing trace with hash 108093540, now seen corresponding path program 1 times [2023-11-06 22:51:51,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:51,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21015563] [2023-11-06 22:51:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:52,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:52,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21015563] [2023-11-06 22:51:52,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21015563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:52,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:52,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:51:52,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396972102] [2023-11-06 22:51:52,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:52,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:51:52,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:52,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:51:52,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:51:52,144 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:52,216 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2023-11-06 22:51:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:51:52,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-06 22:51:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:52,218 INFO L225 Difference]: With dead ends: 45 [2023-11-06 22:51:52,218 INFO L226 Difference]: Without dead ends: 32 [2023-11-06 22:51:52,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:51:52,220 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:52,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 16 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:51:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-06 22:51:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2023-11-06 22:51:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-11-06 22:51:52,229 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2023-11-06 22:51:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:52,230 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-11-06 22:51:52,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-11-06 22:51:52,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-06 22:51:52,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:52,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:52,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:51:52,232 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:52,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:52,233 INFO L85 PathProgramCache]: Analyzing trace with hash 615941150, now seen corresponding path program 1 times [2023-11-06 22:51:52,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:52,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582764656] [2023-11-06 22:51:52,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:53,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:53,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582764656] [2023-11-06 22:51:53,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582764656] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:53,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320091199] [2023-11-06 22:51:53,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:53,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:53,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:53,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:53,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:51:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-06 22:51:53,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:54,162 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:51:54,183 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:51:54,249 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:51:54,468 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-06 22:51:54,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-06 22:51:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:54,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:51:55,297 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:51:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:55,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320091199] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:51:55,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:51:55,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2023-11-06 22:51:55,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326016237] [2023-11-06 22:51:55,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:51:55,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-06 22:51:55,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:55,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-06 22:51:55,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2023-11-06 22:51:55,343 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 33 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 33 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:56,282 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2023-11-06 22:51:56,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:51:56,283 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 33 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-06 22:51:56,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:56,284 INFO L225 Difference]: With dead ends: 56 [2023-11-06 22:51:56,284 INFO L226 Difference]: Without dead ends: 54 [2023-11-06 22:51:56,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=290, Invalid=1516, Unknown=0, NotChecked=0, Total=1806 [2023-11-06 22:51:56,287 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 91 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:56,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 131 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:51:56,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-06 22:51:56,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2023-11-06 22:51:56,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2023-11-06 22:51:56,311 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 20 [2023-11-06 22:51:56,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:56,312 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2023-11-06 22:51:56,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 33 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2023-11-06 22:51:56,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:51:56,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:56,315 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:56,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:51:56,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:56,521 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:56,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:56,521 INFO L85 PathProgramCache]: Analyzing trace with hash 952727132, now seen corresponding path program 2 times [2023-11-06 22:51:56,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:56,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720873634] [2023-11-06 22:51:56,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:56,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:51:56,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:56,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720873634] [2023-11-06 22:51:56,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720873634] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:56,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706469068] [2023-11-06 22:51:56,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:51:56,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:56,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:56,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:56,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:51:56,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:51:56,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:51:56,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:51:56,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:51:56,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:51:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:51:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706469068] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:51:56,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:51:56,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-06 22:51:56,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028000375] [2023-11-06 22:51:56,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:51:56,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:51:56,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:56,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:51:56,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:51:56,861 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:57,116 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2023-11-06 22:51:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:51:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-06 22:51:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:57,121 INFO L225 Difference]: With dead ends: 76 [2023-11-06 22:51:57,121 INFO L226 Difference]: Without dead ends: 44 [2023-11-06 22:51:57,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:51:57,127 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 157 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:57,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 81 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:51:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-06 22:51:57,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2023-11-06 22:51:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-11-06 22:51:57,142 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2023-11-06 22:51:57,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:57,143 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-11-06 22:51:57,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-11-06 22:51:57,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 22:51:57,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:57,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:57,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 22:51:57,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:57,350 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:57,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1304966232, now seen corresponding path program 3 times [2023-11-06 22:51:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:57,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734251441] [2023-11-06 22:51:57,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:57,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:59,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:59,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734251441] [2023-11-06 22:51:59,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734251441] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:59,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896598978] [2023-11-06 22:51:59,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:51:59,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:59,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:59,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:59,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:51:59,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:51:59,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:51:59,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-06 22:51:59,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:59,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:51:59,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:51:59,477 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:51:59,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:51:59,666 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 22:52:00,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:00,035 INFO L351 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 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-06 22:52:00,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:00,225 INFO L322 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-06 22:52:00,225 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 42 [2023-11-06 22:52:00,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:00,743 INFO L322 Elim1Store]: treesize reduction 24, result has 47.8 percent of original size [2023-11-06 22:52:00,744 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2023-11-06 22:52:01,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:01,137 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:52:01,168 INFO L322 Elim1Store]: treesize reduction 24, result has 47.8 percent of original size [2023-11-06 22:52:01,169 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 73 [2023-11-06 22:52:01,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:01,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:01,757 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2023-11-06 22:52:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:52:01,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:08,537 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:52:08,551 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:52:08,551 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 1 [2023-11-06 22:52:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:52:08,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896598978] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:52:08,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:52:08,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 20] total 58 [2023-11-06 22:52:08,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628273213] [2023-11-06 22:52:08,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:52:08,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-06 22:52:08,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:08,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-06 22:52:08,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=2921, Unknown=1, NotChecked=0, Total=3306 [2023-11-06 22:52:08,557 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 58 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:30,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:53:26,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:26,943 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2023-11-06 22:53:26,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-11-06 22:53:26,951 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-06 22:53:26,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:26,954 INFO L225 Difference]: With dead ends: 143 [2023-11-06 22:53:26,954 INFO L226 Difference]: Without dead ends: 141 [2023-11-06 22:53:26,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4628 ImplicationChecksByTransitivity, 65.9s TimeCoverageRelationStatistics Valid=1956, Invalid=14289, Unknown=11, NotChecked=0, Total=16256 [2023-11-06 22:53:26,963 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 464 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 296 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:26,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 398 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1265 Invalid, 1 Unknown, 0 Unchecked, 20.3s Time] [2023-11-06 22:53:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-06 22:53:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 71. [2023-11-06 22:53:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 70 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2023-11-06 22:53:27,006 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 26 [2023-11-06 22:53:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:27,006 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2023-11-06 22:53:27,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2023-11-06 22:53:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:53:27,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:27,009 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:27,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:27,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:27,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:27,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:27,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1672696980, now seen corresponding path program 4 times [2023-11-06 22:53:27,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:27,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172073692] [2023-11-06 22:53:27,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:27,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:53:27,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:27,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172073692] [2023-11-06 22:53:27,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172073692] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:27,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643819543] [2023-11-06 22:53:27,374 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:53:27,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:27,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:27,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:27,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:53:27,468 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:53:27,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:53:27,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:53:27,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:53:27,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:53:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643819543] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:27,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:53:27,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-06 22:53:27,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396955768] [2023-11-06 22:53:27,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:27,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:53:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:27,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:53:27,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:53:27,659 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:28,055 INFO L93 Difference]: Finished difference Result 127 states and 145 transitions. [2023-11-06 22:53:28,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:53:28,056 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-06 22:53:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:28,057 INFO L225 Difference]: With dead ends: 127 [2023-11-06 22:53:28,057 INFO L226 Difference]: Without dead ends: 105 [2023-11-06 22:53:28,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:53:28,059 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 77 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:28,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 123 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:53:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-06 22:53:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2023-11-06 22:53:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 66 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2023-11-06 22:53:28,109 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 30 [2023-11-06 22:53:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:28,109 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2023-11-06 22:53:28,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2023-11-06 22:53:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 22:53:28,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:28,111 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:28,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:28,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:53:28,318 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:28,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:28,318 INFO L85 PathProgramCache]: Analyzing trace with hash -549885364, now seen corresponding path program 1 times [2023-11-06 22:53:28,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377566303] [2023-11-06 22:53:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:28,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:53:28,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:28,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377566303] [2023-11-06 22:53:28,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377566303] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:28,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928193688] [2023-11-06 22:53:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:28,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:28,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:28,455 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:28,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:53:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:28,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:53:28,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:53:28,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:53:28,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928193688] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:28,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:53:28,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-06 22:53:28,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287266644] [2023-11-06 22:53:28,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:28,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:53:28,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:28,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:53:28,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:53:28,734 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:28,963 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2023-11-06 22:53:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:53:28,964 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-06 22:53:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:28,965 INFO L225 Difference]: With dead ends: 110 [2023-11-06 22:53:28,965 INFO L226 Difference]: Without dead ends: 56 [2023-11-06 22:53:28,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:53:28,966 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 92 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:28,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 53 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:53:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-06 22:53:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 35. [2023-11-06 22:53:28,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:28,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2023-11-06 22:53:28,984 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2023-11-06 22:53:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:28,984 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-11-06 22:53:28,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2023-11-06 22:53:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 22:53:28,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:28,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:28,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-06 22:53:29,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:53:29,192 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:29,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:29,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1505554158, now seen corresponding path program 5 times [2023-11-06 22:53:29,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:29,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262678357] [2023-11-06 22:53:29,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:29,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:31,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:31,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262678357] [2023-11-06 22:53:31,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262678357] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:31,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35440832] [2023-11-06 22:53:31,589 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:53:31,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:31,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:31,590 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:31,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:53:31,705 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-06 22:53:31,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:53:31,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-06 22:53:31,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:31,819 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:53:31,826 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:53:31,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:53:32,065 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 22:53:32,250 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-06 22:53:32,559 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2023-11-06 22:53:32,772 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2023-11-06 22:53:32,964 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2023-11-06 22:53:33,179 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2023-11-06 22:53:33,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2023-11-06 22:53:33,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:53:33,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:53:33,585 INFO L322 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2023-11-06 22:53:33,585 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 64 [2023-11-06 22:53:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:33,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:43,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35440832] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:43,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:53:43,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 24] total 68 [2023-11-06 22:53:43,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684701101] [2023-11-06 22:53:43,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:43,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-06 22:53:43,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:43,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-06 22:53:43,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=4137, Unknown=0, NotChecked=0, Total=4556 [2023-11-06 22:53:43,768 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 68 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:01,213 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse23 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse80 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse81 (* c_~N~0 8)) (.cse70 (+ .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse18 0)) (.cse20 (not (= c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)))) (.cse37 (store .cse18 .cse70 1)) (.cse38 (not (= (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse52 (+ (- 16) .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (+ .cse81 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) (.cse1 (select .cse18 .cse70)) (.cse54 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse16 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse21 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ c_~N~0 1)) (.cse22 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (and (= .cse0 4) (= c_~N~0 3) (= .cse1 .cse2) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (= (select (let ((.cse17 (store .cse18 .cse19 1))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse12)))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse14))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8))) (.cse3 (let ((.cse8 (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse14) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse9 .cse10 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse11 .cse12)))) (store .cse6 .cse7 (+ (select .cse8 .cse7) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse3 .cse4 (+ (select .cse3 .cse4) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2) (< |v_ULTIMATE.start_main_~i~0#1_92| 2))) .cse20) (or (and (= .cse0 1) (= .cse21 c_~N~0)) .cse22) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse18 8) 4) (= (select (store .cse18 .cse23 (+ .cse21 (select .cse18 .cse23))) 0) .cse2) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (= (select (let ((.cse36 (store .cse37 .cse19 1))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36))) (let ((.cse35 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse30 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse32 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse31 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (let ((.cse34 (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30 .cse31 .cse32)))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse34))) (let ((.cse24 (let ((.cse28 (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse34) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse29 .cse30 .cse31 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse32)))) (store .cse27 .cse7 (+ (select (select (store .cse26 |c_ULTIMATE.start_main_~a~0#1.base| .cse27) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse28 .cse7)))))) (.cse25 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)))) (store .cse24 .cse25 (+ (select (select (store .cse26 |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse24 .cse25)))))))))))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2) (< |v_ULTIMATE.start_main_~i~0#1_92| 2))) .cse20) (or .cse38 (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_92| 2) (= (select (let ((.cse51 (store (store .cse37 .cse52 1) .cse19 1))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse51))) (let ((.cse50 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse47 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse44 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse46 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (let ((.cse49 (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45 .cse46 .cse47)))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse49))) (let ((.cse40 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8))) (.cse39 (let ((.cse43 (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse49) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse42 (store .cse43 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse44 .cse45 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse46 .cse47)))) (store .cse42 .cse7 (+ (select .cse43 .cse7) (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse39 .cse40 (+ (select .cse39 .cse40) (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (= (select (let ((.cse53 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)))) (store .cse18 .cse53 (+ .cse21 (select .cse18 .cse53)))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2) (< |v_ULTIMATE.start_main_~i~0#1_92| .cse54))) (or .cse38 (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_92| 2) (= (select (let ((.cse67 (store (store .cse18 .cse52 1) .cse19 1))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse67))) (let ((.cse66 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse61 (select .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse63 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse60 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse62 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse61 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (let ((.cse65 (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse61 .cse62 .cse63)))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse65))) (let ((.cse55 (let ((.cse59 (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse65) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse58 (store .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse60 .cse61 (select .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse62 .cse63)))) (store .cse58 .cse7 (+ (select (select (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| .cse58) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse59 .cse7)))))) (.cse56 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)))) (store .cse55 .cse56 (+ (select (select (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| .cse55) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse55 .cse56)))))))))))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (= (select (let ((.cse68 (store .cse18 .cse70 (+ .cse21 .cse1))) (.cse69 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)))) (store .cse68 .cse69 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse68) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse68 .cse69)))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2) (< |v_ULTIMATE.start_main_~i~0#1_92| .cse54))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse71 (select .cse18 16))) (or (= .cse71 4) (= .cse71 1))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_92| 2) (= (select (let ((.cse79 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse77 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse78 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse77 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse77 .cse78 .cse79))))) (let ((.cse72 (let ((.cse76 (select .cse74 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse75 (store .cse76 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse21 .cse77 (select .cse76 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse78 .cse79)))) (store .cse75 .cse7 (+ (select .cse76 .cse7) (select (select (store .cse74 |c_ULTIMATE.start_main_~a~0#1.base| .cse75) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse73 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)))) (store .cse72 .cse73 (+ (select (select (store .cse74 |c_ULTIMATE.start_main_~a~0#1.base| .cse72) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse72 .cse73)))))))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2))) .cse22))))) is different from true [2023-11-06 22:54:13,208 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse33 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse80 (* c_~N~0 8)) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse79 (+ .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse18 (not (= c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)))) (.cse32 (store .cse15 .cse79 1)) (.cse48 (not (= (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse13 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse62 (+ (- 16) .cse80 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (+ .cse80 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) (.cse34 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse17 (+ c_~N~0 1)) (.cse19 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (= (select (let ((.cse14 (store .cse15 .cse16 1))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8 .cse9)))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse11))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8))) (.cse0 (let ((.cse5 (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse11) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse6 .cse7 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8 .cse9)))) (store .cse3 .cse4 (+ (select .cse5 .cse4) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse17) (< |v_ULTIMATE.start_main_~i~0#1_92| 2))) .cse18) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (mod c_~N~0 4294967296) 536870911) (or (not (= .cse19 c_~N~0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_92| 2) (= (select (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32))) (let ((.cse31 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse28 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse27 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse26 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse27 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27 .cse28)))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse30))) (let ((.cse21 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8))) (.cse20 (let ((.cse24 (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse30) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse25 .cse26 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse27 .cse28)))) (store .cse23 .cse4 (+ (select .cse24 .cse4) (select (select (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse20 .cse21 (+ (select .cse20 .cse21) (select (select (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))))))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse17)))) (= (select .cse15 0) .cse17) (= (select (store .cse15 .cse33 (+ .cse34 (select .cse15 .cse33))) 0) .cse17) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (= (select (let ((.cse47 (store .cse32 .cse16 1))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse47))) (let ((.cse46 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse40 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse41 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse42 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse41 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse45 (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse41 .cse42 .cse43)))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse45))) (let ((.cse35 (let ((.cse39 (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse45) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse38 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse40 .cse41 .cse42 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse43)))) (store .cse38 .cse4 (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| .cse38) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse39 .cse4)))))) (.cse36 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)))) (store .cse35 .cse36 (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse35 .cse36)))))))))))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse17) (< |v_ULTIMATE.start_main_~i~0#1_92| 2))) .cse18) (or .cse48 (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_92| 2) (= (select (let ((.cse61 (store (store .cse32 .cse62 1) .cse16 1))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse61))) (let ((.cse60 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse55 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse57 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse54 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse56 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse59 (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55 .cse56 .cse57)))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse59))) (let ((.cse50 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8))) (.cse49 (let ((.cse53 (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse59) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse52 (store .cse53 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse54 .cse55 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse56 .cse57)))) (store .cse52 .cse4 (+ (select .cse53 .cse4) (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| .cse52) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse49 .cse50 (+ (select .cse49 .cse50) (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse17)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (= (select (let ((.cse63 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)))) (store .cse15 .cse63 (+ .cse34 (select .cse15 .cse63)))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse17) (< |v_ULTIMATE.start_main_~i~0#1_92| .cse19))) (or .cse48 (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_92| 2) (= (select (let ((.cse76 (store (store .cse15 .cse62 1) .cse16 1))) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse76))) (let ((.cse75 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse70 (select .cse76 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse72 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse69 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse71 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse69 .cse70 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse69 .cse70 .cse71 .cse72)))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse74))) (let ((.cse64 (let ((.cse68 (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse74) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse67 (store .cse68 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse69 .cse70 (select .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse71 .cse72)))) (store .cse67 .cse4 (+ (select (select (store .cse66 |c_ULTIMATE.start_main_~a~0#1.base| .cse67) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse68 .cse4)))))) (.cse65 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)))) (store .cse64 .cse65 (+ (select (select (store .cse66 |c_ULTIMATE.start_main_~a~0#1.base| .cse64) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse64 .cse65)))))))))))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse17)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (= (select (let ((.cse77 (store .cse15 .cse79 (+ .cse34 (select .cse15 .cse79)))) (.cse78 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)))) (store .cse77 .cse78 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse77) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse77 .cse78)))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse17) (< |v_ULTIMATE.start_main_~i~0#1_92| .cse19))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))))) is different from true [2023-11-06 22:54:16,141 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse61 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse63 (* c_~N~0 8)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse52 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse18 (store .cse0 .cse52 1)) (.cse19 (not (= (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse33 (+ (- 16) .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse34 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) (.cse1 (select .cse0 .cse52)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse17 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse36 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ c_~N~0 1))) (and (= (select .cse0 0) 4) (= c_~N~0 3) (= .cse1 .cse2) (= (select .cse0 8) 4) (or (not (= .cse3 c_~N~0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_92| 2) (= (select (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18))) (let ((.cse16 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse13 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse11 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13)))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse15))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8))) (.cse4 (let ((.cse9 (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse15) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse10 .cse11 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse12 .cse13)))) (store .cse7 .cse8 (+ (select .cse9 .cse8) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse4 .cse5 (+ (select .cse4 .cse5) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))))))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2)))) (or .cse19 (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_92| 2) (= (select (let ((.cse32 (store (store .cse18 .cse33 1) .cse34 1))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32))) (let ((.cse31 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse28 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse25 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse27 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27 .cse28)))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse30))) (let ((.cse21 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8))) (.cse20 (let ((.cse24 (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse30) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse25 .cse26 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse27 .cse28)))) (store .cse23 .cse8 (+ (select .cse24 .cse8) (select (select (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse20 .cse21 (+ (select .cse20 .cse21) (select (select (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (= (select (let ((.cse35 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)))) (store .cse0 .cse35 (+ .cse36 (select .cse0 .cse35)))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2) (< |v_ULTIMATE.start_main_~i~0#1_92| .cse3))) (or .cse19 (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_92| 2) (= (select (let ((.cse49 (store (store .cse0 .cse33 1) .cse34 1))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse49))) (let ((.cse48 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse45 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse42 (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse44 (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17))) (let ((.cse47 (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43 .cse44 .cse45)))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse47))) (let ((.cse37 (let ((.cse41 (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse47) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse40 (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse42 .cse43 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse44 .cse45)))) (store .cse40 .cse8 (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse41 .cse8)))))) (.cse38 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)))) (store .cse37 .cse38 (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse37 .cse38)))))))))))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (= (select (let ((.cse50 (store .cse0 .cse52 (+ .cse36 .cse1))) (.cse51 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)))) (store .cse50 .cse51 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse50) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse50 .cse51)))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2) (< |v_ULTIMATE.start_main_~i~0#1_92| .cse3))) (or (< .cse3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_92| 2) (= (select (let ((.cse60 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse60))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse59 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse58 .cse60))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17))) (let ((.cse55 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse58 .cse59 .cse60))))) (let ((.cse53 (let ((.cse57 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse56 (store .cse57 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse36 .cse58 (select .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse59 .cse60)))) (store .cse56 .cse8 (+ (select .cse57 .cse8) (select (select (store .cse55 |c_ULTIMATE.start_main_~a~0#1.base| .cse56) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse54 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)))) (store .cse53 .cse54 (+ (select (select (store .cse55 |c_ULTIMATE.start_main_~a~0#1.base| .cse53) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse53 .cse54)))))))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse62 (select .cse0 16))) (or (= .cse62 4) (= .cse62 1))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))))) is different from true [2023-11-06 22:54:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:54:20,095 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2023-11-06 22:54:20,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-06 22:54:20,096 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-06 22:54:20,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:54:20,097 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:54:20,097 INFO L226 Difference]: Without dead ends: 105 [2023-11-06 22:54:20,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3530 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=1043, Invalid=10308, Unknown=3, NotChecked=636, Total=11990 [2023-11-06 22:54:20,103 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 193 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:54:20,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 251 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1253 Invalid, 0 Unknown, 192 Unchecked, 9.3s Time] [2023-11-06 22:54:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-06 22:54:20,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 71. [2023-11-06 22:54:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 70 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2023-11-06 22:54:20,139 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 32 [2023-11-06 22:54:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:54:20,139 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2023-11-06 22:54:20,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:20,140 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2023-11-06 22:54:20,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 22:54:20,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:54:20,141 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:54:20,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:54:20,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 22:54:20,341 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:54:20,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:54:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash 526321296, now seen corresponding path program 6 times [2023-11-06 22:54:20,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:54:20,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173805624] [2023-11-06 22:54:20,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:54:20,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:54:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:54:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:54:20,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:54:20,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173805624] [2023-11-06 22:54:20,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173805624] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:54:20,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119750465] [2023-11-06 22:54:20,514 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:54:20,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:54:20,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:54:20,519 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:54:20,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:54:20,666 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-06 22:54:20,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:54:20,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:54:20,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:54:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:54:20,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:54:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:54:20,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119750465] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:54:20,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:54:20,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-06 22:54:20,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120407452] [2023-11-06 22:54:20,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:54:20,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:54:20,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:54:20,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:54:20,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:54:20,891 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:54:21,405 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2023-11-06 22:54:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:54:21,406 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-06 22:54:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:54:21,407 INFO L225 Difference]: With dead ends: 133 [2023-11-06 22:54:21,407 INFO L226 Difference]: Without dead ends: 115 [2023-11-06 22:54:21,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:54:21,410 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 101 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:54:21,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 171 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:54:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-06 22:54:21,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 77. [2023-11-06 22:54:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.118421052631579) internal successors, (85), 76 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2023-11-06 22:54:21,473 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 34 [2023-11-06 22:54:21,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:54:21,474 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2023-11-06 22:54:21,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2023-11-06 22:54:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:54:21,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:54:21,480 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:54:21,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:54:21,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-06 22:54:21,686 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:54:21,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:54:21,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1100590202, now seen corresponding path program 2 times [2023-11-06 22:54:21,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:54:21,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327557959] [2023-11-06 22:54:21,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:54:21,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:54:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:54:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:54:21,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:54:21,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327557959] [2023-11-06 22:54:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327557959] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:54:21,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581482873] [2023-11-06 22:54:21,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:54:21,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:54:21,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:54:21,861 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:54:21,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:54:21,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:54:21,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:54:21,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:54:21,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:54:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:54:22,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:54:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:54:22,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581482873] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:54:22,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:54:22,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-06 22:54:22,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609482821] [2023-11-06 22:54:22,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:54:22,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:54:22,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:54:22,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:54:22,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:54:22,180 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:22,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:54:22,471 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2023-11-06 22:54:22,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:54:22,471 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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 38 [2023-11-06 22:54:22,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:54:22,472 INFO L225 Difference]: With dead ends: 134 [2023-11-06 22:54:22,472 INFO L226 Difference]: Without dead ends: 97 [2023-11-06 22:54:22,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:54:22,474 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 118 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:54:22,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 83 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:54:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-06 22:54:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 68. [2023-11-06 22:54:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2023-11-06 22:54:22,517 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 38 [2023-11-06 22:54:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:54:22,518 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2023-11-06 22:54:22,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2023-11-06 22:54:22,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:54:22,520 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:54:22,520 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:54:22,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:54:22,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:54:22,726 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:54:22,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:54:22,727 INFO L85 PathProgramCache]: Analyzing trace with hash -389301684, now seen corresponding path program 7 times [2023-11-06 22:54:22,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:54:22,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141504483] [2023-11-06 22:54:22,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:54:22,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:54:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:54:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:54:25,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:54:25,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141504483] [2023-11-06 22:54:25,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141504483] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:54:25,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447456556] [2023-11-06 22:54:25,633 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 22:54:25,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:54:25,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:54:25,639 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:54:25,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e0c8d6a-0061-48d2-9b2d-00eee93c6607/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:54:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:54:25,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-06 22:54:25,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:54:25,893 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:54:25,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:54:25,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:54:26,164 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 22:54:26,346 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-06 22:54:26,570 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-11-06 22:54:26,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2023-11-06 22:54:27,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2023-11-06 22:54:27,277 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2023-11-06 22:54:27,518 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2023-11-06 22:54:27,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2023-11-06 22:54:28,018 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2023-11-06 22:54:28,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2023-11-06 22:54:28,513 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2023-11-06 22:54:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:54:28,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:54:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:54:39,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447456556] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:54:39,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:54:39,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32, 30] total 83 [2023-11-06 22:54:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675982163] [2023-11-06 22:54:39,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:54:39,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2023-11-06 22:54:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:54:39,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2023-11-06 22:54:39,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=6277, Unknown=0, NotChecked=0, Total=6806 [2023-11-06 22:54:39,264 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 83 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 83 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:44,961 WARN L293 SmtUtils]: Spent 16.19s on a formula simplification that was a NOOP. DAG size: 248 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:55:46,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:48,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:50,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:00,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []