./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/condm.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/condm.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc --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 6f961be2104ef3ac444088284f7936b105cc31dfbd8617bc6896bf1b51a5f23d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:49:13,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:49:13,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:49:13,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:49:13,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:49:13,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:49:13,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:49:14,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:49:14,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:49:14,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:49:14,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:49:14,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:49:14,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:49:14,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:49:14,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:49:14,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:49:14,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:49:14,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:49:14,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:49:14,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:49:14,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:49:14,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:49:14,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:49:14,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:49:14,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:49:14,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:49:14,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:49:14,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:49:14,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:49:14,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:49:14,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:49:14,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:49:14,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:49:14,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:49:14,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:49:14,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:49:14,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:49:14,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:49:14,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:49:14,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:49:14,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:49:14,035 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:49:14,067 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:49:14,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:49:14,070 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:49:14,070 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:49:14,071 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:49:14,072 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:49:14,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:49:14,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:49:14,073 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:49:14,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:49:14,074 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:49:14,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:49:14,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:49:14,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:49:14,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:49:14,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:49:14,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:49:14,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:49:14,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:49:14,076 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:49:14,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:49:14,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:49:14,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:49:14,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:49:14,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:49:14,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:49:14,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:49:14,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:49:14,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:49:14,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:49:14,078 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:49:14,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:49:14,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:49:14,079 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/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_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc 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 -> 6f961be2104ef3ac444088284f7936b105cc31dfbd8617bc6896bf1b51a5f23d [2022-11-02 20:49:14,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:49:14,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:49:14,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:49:14,387 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:49:14,388 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:49:14,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/array-fpi/condm.c [2022-11-02 20:49:14,481 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/data/d4fd19aa5/32c275346419405db8eac482db381725/FLAGbb373968e [2022-11-02 20:49:14,979 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:49:14,979 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/sv-benchmarks/c/array-fpi/condm.c [2022-11-02 20:49:14,986 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/data/d4fd19aa5/32c275346419405db8eac482db381725/FLAGbb373968e [2022-11-02 20:49:15,357 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/data/d4fd19aa5/32c275346419405db8eac482db381725 [2022-11-02 20:49:15,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:49:15,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:49:15,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:49:15,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:49:15,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:49:15,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:49:15" (1/1) ... [2022-11-02 20:49:15,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c6935ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:15, skipping insertion in model container [2022-11-02 20:49:15,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:49:15" (1/1) ... [2022-11-02 20:49:15,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:49:15,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:49:15,593 WARN L230 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_0536206f-ebd9-46ac-a621-62f7a44020e1/sv-benchmarks/c/array-fpi/condm.c[588,601] [2022-11-02 20:49:15,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:49:15,625 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:49:15,638 WARN L230 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_0536206f-ebd9-46ac-a621-62f7a44020e1/sv-benchmarks/c/array-fpi/condm.c[588,601] [2022-11-02 20:49:15,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:49:15,656 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:49:15,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:15 WrapperNode [2022-11-02 20:49:15,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:49:15,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:49:15,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:49:15,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:49:15,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:15" (1/1) ... [2022-11-02 20:49:15,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:15" (1/1) ... [2022-11-02 20:49:15,691 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2022-11-02 20:49:15,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:49:15,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:49:15,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:49:15,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:49:15,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:15" (1/1) ... [2022-11-02 20:49:15,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:15" (1/1) ... [2022-11-02 20:49:15,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:15" (1/1) ... [2022-11-02 20:49:15,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:15" (1/1) ... [2022-11-02 20:49:15,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:15" (1/1) ... [2022-11-02 20:49:15,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:15" (1/1) ... [2022-11-02 20:49:15,713 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:15" (1/1) ... [2022-11-02 20:49:15,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:15" (1/1) ... [2022-11-02 20:49:15,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:49:15,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:49:15,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:49:15,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:49:15,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:15" (1/1) ... [2022-11-02 20:49:15,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:49:15,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:15,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:49:15,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:49:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:49:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:49:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:49:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:49:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:49:15,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:49:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:49:15,891 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:49:15,894 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:49:16,118 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:49:16,124 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:49:16,124 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:49:16,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:16 BoogieIcfgContainer [2022-11-02 20:49:16,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:49:16,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:49:16,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:49:16,147 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:49:16,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:49:15" (1/3) ... [2022-11-02 20:49:16,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439042ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:16, skipping insertion in model container [2022-11-02 20:49:16,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:15" (2/3) ... [2022-11-02 20:49:16,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439042ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:16, skipping insertion in model container [2022-11-02 20:49:16,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:16" (3/3) ... [2022-11-02 20:49:16,151 INFO L112 eAbstractionObserver]: Analyzing ICFG condm.c [2022-11-02 20:49:16,180 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:49:16,196 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:49:16,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:49:16,280 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;@13f5b705, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:49:16,296 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:49:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:49:16,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:16,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:16,312 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:16,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:16,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1828392228, now seen corresponding path program 1 times [2022-11-02 20:49:16,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:16,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969194088] [2022-11-02 20:49:16,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:16,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:16,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:16,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969194088] [2022-11-02 20:49:16,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969194088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:16,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:16,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:49:16,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349818144] [2022-11-02 20:49:16,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:16,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:49:16,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:16,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:49:16,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:49:16,614 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:16,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:16,633 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-11-02 20:49:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:49:16,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 20:49:16,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:16,652 INFO L225 Difference]: With dead ends: 40 [2022-11-02 20:49:16,652 INFO L226 Difference]: Without dead ends: 18 [2022-11-02 20:49:16,655 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 [2022-11-02 20:49:16,666 INFO L413 NwaCegarLoop]: 26 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, 26 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 [2022-11-02 20:49:16,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:49:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-02 20:49:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-02 20:49:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-02 20:49:16,706 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2022-11-02 20:49:16,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:16,707 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-02 20:49:16,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-02 20:49:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:49:16,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:16,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:16,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:49:16,711 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:16,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1148333858, now seen corresponding path program 1 times [2022-11-02 20:49:16,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:16,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032674186] [2022-11-02 20:49:16,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:16,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:16,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:16,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032674186] [2022-11-02 20:49:16,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032674186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:16,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:16,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:49:16,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323795257] [2022-11-02 20:49:16,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:16,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:49:16,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:16,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:49:16,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:49:16,992 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:17,061 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-11-02 20:49:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:49:17,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 20:49:17,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:17,062 INFO L225 Difference]: With dead ends: 40 [2022-11-02 20:49:17,063 INFO L226 Difference]: Without dead ends: 29 [2022-11-02 20:49:17,063 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 [2022-11-02 20:49:17,064 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:17,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 15 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:17,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-02 20:49:17,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-11-02 20:49:17,071 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) [2022-11-02 20:49:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-11-02 20:49:17,072 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-11-02 20:49:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:17,072 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-11-02 20:49:17,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-11-02 20:49:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:49:17,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:17,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:17,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:49:17,075 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:17,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2142875084, now seen corresponding path program 1 times [2022-11-02 20:49:17,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:17,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667715139] [2022-11-02 20:49:17,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:17,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:17,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:17,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667715139] [2022-11-02 20:49:17,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667715139] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:17,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656432251] [2022-11-02 20:49:17,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:17,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:17,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:17,640 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:17,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:49:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:17,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-02 20:49:17,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:17,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:49:17,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:49:18,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2022-11-02 20:49:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:18,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:18,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-02 20:49:18,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 26 [2022-11-02 20:49:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:18,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656432251] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:18,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:18,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2022-11-02 20:49:18,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113387242] [2022-11-02 20:49:18,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:18,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:49:18,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:18,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:49:18,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:49:18,914 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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) [2022-11-02 20:49:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:20,127 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2022-11-02 20:49:20,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:49:20,128 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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 17 [2022-11-02 20:49:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:20,128 INFO L225 Difference]: With dead ends: 76 [2022-11-02 20:49:20,129 INFO L226 Difference]: Without dead ends: 66 [2022-11-02 20:49:20,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=308, Invalid=814, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:49:20,131 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 293 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:20,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 80 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:49:20,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-02 20:49:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 37. [2022-11-02 20:49:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 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) [2022-11-02 20:49:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-02 20:49:20,142 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 17 [2022-11-02 20:49:20,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:20,142 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-02 20:49:20,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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) [2022-11-02 20:49:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-02 20:49:20,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:49:20,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:20,144 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:20,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:20,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:20,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:20,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash -596215012, now seen corresponding path program 1 times [2022-11-02 20:49:20,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:20,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13325382] [2022-11-02 20:49:20,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:20,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:20,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:20,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:20,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13325382] [2022-11-02 20:49:20,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13325382] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:20,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604087105] [2022-11-02 20:49:20,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:20,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:20,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:20,525 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:20,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:49:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:20,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:49:20,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:20,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:20,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604087105] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:20,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:20,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-02 20:49:20,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869995894] [2022-11-02 20:49:20,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:20,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:49:20,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:20,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:49:20,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:49:20,668 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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) [2022-11-02 20:49:20,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:20,811 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-11-02 20:49:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:49:20,812 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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) Word has length 20 [2022-11-02 20:49:20,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:20,813 INFO L225 Difference]: With dead ends: 72 [2022-11-02 20:49:20,813 INFO L226 Difference]: Without dead ends: 50 [2022-11-02 20:49:20,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:49:20,814 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:20,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 51 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-02 20:49:20,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2022-11-02 20:49:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 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) [2022-11-02 20:49:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-11-02 20:49:20,823 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 20 [2022-11-02 20:49:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:20,824 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-11-02 20:49:20,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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) [2022-11-02 20:49:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-11-02 20:49:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:49:20,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:20,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:20,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:21,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:21,049 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:21,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:21,050 INFO L85 PathProgramCache]: Analyzing trace with hash -408404582, now seen corresponding path program 2 times [2022-11-02 20:49:21,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:21,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307449476] [2022-11-02 20:49:21,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:21,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:49:21,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:21,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307449476] [2022-11-02 20:49:21,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307449476] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:21,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548964981] [2022-11-02 20:49:21,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:49:21,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:21,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:21,500 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:21,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:49:21,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:49:21,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:49:21,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:49:21,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:49:21,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:49:21,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548964981] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:21,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:21,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2022-11-02 20:49:21,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402261947] [2022-11-02 20:49:21,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:21,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:49:21,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:21,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:49:21,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:49:21,877 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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) [2022-11-02 20:49:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:22,449 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2022-11-02 20:49:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:49:22,450 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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 [2022-11-02 20:49:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:22,454 INFO L225 Difference]: With dead ends: 153 [2022-11-02 20:49:22,454 INFO L226 Difference]: Without dead ends: 141 [2022-11-02 20:49:22,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=584, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:49:22,457 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 541 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:22,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 64 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:49:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-02 20:49:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 42. [2022-11-02 20:49:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-11-02 20:49:22,478 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 22 [2022-11-02 20:49:22,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:22,478 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-11-02 20:49:22,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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) [2022-11-02 20:49:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-11-02 20:49:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:49:22,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:22,479 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:22,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:22,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:22,708 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:22,709 INFO L85 PathProgramCache]: Analyzing trace with hash -311207784, now seen corresponding path program 3 times [2022-11-02 20:49:22,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:22,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961845579] [2022-11-02 20:49:22,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:22,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:22,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:22,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961845579] [2022-11-02 20:49:22,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961845579] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:22,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244299326] [2022-11-02 20:49:22,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:49:22,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:22,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:22,855 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:22,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:49:22,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:49:22,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:49:22,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:49:22,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:49:23,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:49:23,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244299326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:23,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:23,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 20 [2022-11-02 20:49:23,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85944834] [2022-11-02 20:49:23,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:23,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 20:49:23,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:23,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:49:23,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:49:23,205 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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) [2022-11-02 20:49:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:24,320 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-11-02 20:49:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:49:24,320 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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 24 [2022-11-02 20:49:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:24,321 INFO L225 Difference]: With dead ends: 112 [2022-11-02 20:49:24,321 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 20:49:24,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=382, Invalid=1258, Unknown=0, NotChecked=0, Total=1640 [2022-11-02 20:49:24,323 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 272 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:24,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 171 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:49:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 20:49:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 58. [2022-11-02 20:49:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-11-02 20:49:24,343 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 24 [2022-11-02 20:49:24,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:24,344 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-11-02 20:49:24,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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) [2022-11-02 20:49:24,344 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-11-02 20:49:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:49:24,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:24,345 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] [2022-11-02 20:49:24,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-02 20:49:24,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:49:24,553 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:24,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:24,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1394926352, now seen corresponding path program 1 times [2022-11-02 20:49:24,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:24,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24497172] [2022-11-02 20:49:24,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:24,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:25,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:25,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24497172] [2022-11-02 20:49:25,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24497172] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:25,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686340072] [2022-11-02 20:49:25,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:25,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:25,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:25,877 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:25,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:49:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:25,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-02 20:49:25,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:25,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 20:49:26,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:26,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-11-02 20:49:26,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:49:26,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:26,193 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:26,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 41 [2022-11-02 20:49:26,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:26,316 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:26,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 38 treesize of output 25 [2022-11-02 20:49:26,684 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:26,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 31 [2022-11-02 20:49:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:26,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:29,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 170 [2022-11-02 20:49:29,065 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:29,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 275 [2022-11-02 20:49:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:29,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686340072] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:29,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:29,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 39 [2022-11-02 20:49:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628727029] [2022-11-02 20:49:29,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:29,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-02 20:49:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:29,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-02 20:49:29,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1184, Unknown=0, NotChecked=0, Total=1482 [2022-11-02 20:49:29,195 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 39 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:40,229 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2022-11-02 20:49:40,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-02 20:49:40,230 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 39 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 20:49:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:40,231 INFO L225 Difference]: With dead ends: 124 [2022-11-02 20:49:40,231 INFO L226 Difference]: Without dead ends: 122 [2022-11-02 20:49:40,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1036, Invalid=4366, Unknown=0, NotChecked=0, Total=5402 [2022-11-02 20:49:40,234 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 437 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:40,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 106 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:49:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-02 20:49:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 62. [2022-11-02 20:49:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 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) [2022-11-02 20:49:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2022-11-02 20:49:40,251 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 26 [2022-11-02 20:49:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:40,252 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2022-11-02 20:49:40,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 39 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-11-02 20:49:40,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:49:40,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:40,253 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:40,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:40,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:40,475 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:40,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:40,475 INFO L85 PathProgramCache]: Analyzing trace with hash -562149382, now seen corresponding path program 4 times [2022-11-02 20:49:40,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:40,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797486520] [2022-11-02 20:49:40,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:40,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:42,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:42,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797486520] [2022-11-02 20:49:42,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797486520] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:42,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69240271] [2022-11-02 20:49:42,413 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:49:42,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:42,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:42,415 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:42,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:49:42,467 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:49:42,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:49:42,469 WARN L261 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 20:49:42,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:42,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 20:49:42,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-02 20:49:42,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-02 20:49:42,832 INFO L356 Elim1Store]: treesize reduction 25, result has 59.7 percent of original size [2022-11-02 20:49:42,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 53 [2022-11-02 20:49:43,141 INFO L356 Elim1Store]: treesize reduction 53, result has 36.1 percent of original size [2022-11-02 20:49:43,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 70 [2022-11-02 20:49:43,431 INFO L356 Elim1Store]: treesize reduction 53, result has 36.1 percent of original size [2022-11-02 20:49:43,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 67 [2022-11-02 20:49:43,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2022-11-02 20:49:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:43,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:46,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69240271] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:46,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:46,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 52 [2022-11-02 20:49:46,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029328399] [2022-11-02 20:49:46,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:46,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-02 20:49:46,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:46,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-02 20:49:46,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2280, Unknown=0, NotChecked=0, Total=2652 [2022-11-02 20:49:46,150 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 52 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 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) [2022-11-02 20:49:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:48,563 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2022-11-02 20:49:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-02 20:49:48,563 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 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 27 [2022-11-02 20:49:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:48,564 INFO L225 Difference]: With dead ends: 95 [2022-11-02 20:49:48,565 INFO L226 Difference]: Without dead ends: 93 [2022-11-02 20:49:48,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=836, Invalid=5326, Unknown=0, NotChecked=0, Total=6162 [2022-11-02 20:49:48,567 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 60 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:48,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 225 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 140 Invalid, 0 Unknown, 201 Unchecked, 0.2s Time] [2022-11-02 20:49:48,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-02 20:49:48,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2022-11-02 20:49:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 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) [2022-11-02 20:49:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2022-11-02 20:49:48,583 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 27 [2022-11-02 20:49:48,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:48,583 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2022-11-02 20:49:48,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 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) [2022-11-02 20:49:48,584 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-11-02 20:49:48,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:49:48,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:48,585 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:48,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:48,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:49:48,789 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:48,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:48,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1446324666, now seen corresponding path program 2 times [2022-11-02 20:49:48,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:48,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87379041] [2022-11-02 20:49:48,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:48,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:49:48,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:48,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87379041] [2022-11-02 20:49:48,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87379041] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:48,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465678845] [2022-11-02 20:49:48,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:49:48,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:48,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:48,942 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:48,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:49:49,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:49:49,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:49:49,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:49:49,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:49:49,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:49:49,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465678845] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:49,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:49,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-02 20:49:49,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951253831] [2022-11-02 20:49:49,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:49,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:49:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:49,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:49:49,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:49:49,174 INFO L87 Difference]: Start difference. First operand 63 states and 71 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) [2022-11-02 20:49:49,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:49,348 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2022-11-02 20:49:49,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:49:49,349 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 [2022-11-02 20:49:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:49,352 INFO L225 Difference]: With dead ends: 116 [2022-11-02 20:49:49,352 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 20:49:49,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:49:49,356 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 70 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:49,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 73 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 20:49:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2022-11-02 20:49:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 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) [2022-11-02 20:49:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-11-02 20:49:49,391 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 30 [2022-11-02 20:49:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:49,392 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-11-02 20:49:49,392 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) [2022-11-02 20:49:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-11-02 20:49:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:49:49,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:49,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:49,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:49,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:49,612 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:49,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:49,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1857271344, now seen corresponding path program 1 times [2022-11-02 20:49:49,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:49,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618731513] [2022-11-02 20:49:49,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:49,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:51,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:51,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618731513] [2022-11-02 20:49:51,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618731513] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:51,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576966574] [2022-11-02 20:49:51,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:51,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:51,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:51,517 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:51,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0536206f-ebd9-46ac-a621-62f7a44020e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:49:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:51,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-02 20:49:51,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:51,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 20:49:51,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:51,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:49:51,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:51,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:51,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:51,721 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:51,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-02 20:49:51,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:51,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:49:51,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:51,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 43 [2022-11-02 20:49:52,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:49:52,070 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:52,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 48 [2022-11-02 20:49:52,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:52,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:52,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:52,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:52,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-02 20:49:52,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:52,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 37 [2022-11-02 20:49:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:52,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:24,275 WARN L234 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:52:00,617 WARN L234 SmtUtils]: Spent 22.03s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:52:02,858 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse13 .cse14 (+ (select .cse13 .cse14) 1))))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse1 (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse2 (select .cse1 .cse3))) (or (= (mod (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (mod .cse2 2)) (< .cse2 0))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse5 (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse6 (select .cse5 .cse3))) (or (not (= (mod (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0)) (= (mod .cse6 2) 0) (not (< .cse6 0)))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse8 (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse7 (mod (select .cse8 .cse3) 2))) (or (not (= .cse7 0)) (= (mod (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse7))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse9 (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse10 (select .cse9 .cse3))) (or (< (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (= (mod .cse10 2) 0) (not (< .cse10 0)))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse12 (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (<= 0 .cse11) (= (mod .cse11 2) 0) (< (select .cse12 .cse3) 0))))))))) is different from false [2022-11-02 20:52:27,419 WARN L234 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:53:14,978 WARN L234 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:53:17,237 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (forall ((v_ArrVal_207 Int)) (let ((.cse2 (store (let ((.cse4 (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse3 (+ (select .cse4 .cse3) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse1 (select .cse2 .cse3))) (or (not (< .cse1 0)) (= (mod .cse1 2) 0) (not (= (mod (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0)))))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse7 (store (let ((.cse8 (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse3 (+ (select .cse8 .cse3) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse6 (select .cse7 .cse3))) (or (< .cse6 0) (= (mod (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (mod .cse6 2)))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse9 (store (let ((.cse11 (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse3 (+ (select .cse11 .cse3) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse10 (mod (select .cse9 .cse3) 2))) (or (= (mod (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse10) (not (= .cse10 0)))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse12 (store (let ((.cse14 (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse3 (+ (select .cse14 .cse3) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (select .cse12 .cse3) 0) (<= 0 .cse13) (= (mod .cse13 2) 0))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse16 (store (let ((.cse17 (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse3 (+ (select .cse17 .cse3) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse15 (select .cse16 .cse3))) (or (not (< .cse15 0)) (< (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (= (mod .cse15 2) 0))))))))))) is different from false [2022-11-02 20:53:19,446 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 0))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse1 (store (let ((.cse3 (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse2 (+ (select .cse3 .cse2) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse0 (select .cse1 .cse2))) (or (= (mod .cse0 2) 0) (not (< .cse0 0)) (< (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_99|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse7 (store (let ((.cse8 (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse2 (+ (select .cse8 .cse2) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse6 2) 0) (< (select .cse7 .cse2) 0) (<= 0 .cse6))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse9 (store (let ((.cse11 (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse2 (+ (select .cse11 .cse2) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse10 (select .cse9 .cse2))) (or (= (mod (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (mod .cse10 2)) (< .cse10 0))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse12 (store (let ((.cse14 (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse2 (+ (select .cse14 .cse2) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse13 (mod (select .cse12 .cse2) 2))) (or (= (mod (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse13) (not (= .cse13 0)))))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_99|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse16 (store (let ((.cse17 (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse2 (+ (select .cse17 .cse2) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse15 (select .cse16 .cse2))) (or (= (mod .cse15 2) 0) (not (< .cse15 0)) (not (= (mod (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0)))))))))))) is different from false [2022-11-02 20:53:19,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 299 [2022-11-02 20:53:19,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:19,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7385 treesize of output 7305 [2022-11-02 20:53:20,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 297 [2022-11-02 20:53:20,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:20,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3046 treesize of output 2938 [2022-11-02 20:53:21,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 293 [2022-11-02 20:53:21,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:21,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6150 treesize of output 6018 [2022-11-02 20:53:24,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 296 [2022-11-02 20:53:24,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:24,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 499 treesize of output 1 [2022-11-02 20:53:24,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 294 [2022-11-02 20:53:24,288 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:24,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15373 treesize of output 1 [2022-11-02 20:53:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 2 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-02 20:53:24,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576966574] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:24,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:24,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 48 [2022-11-02 20:53:24,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156696038] [2022-11-02 20:53:24,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:24,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-02 20:53:24,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:24,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-02 20:53:24,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1688, Unknown=69, NotChecked=264, Total=2256 [2022-11-02 20:53:24,351 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 48 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 48 states have internal predecessors, (77), 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) [2022-11-02 20:53:26,438 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse21 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (store .cse11 (+ .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 0))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse1 (store (let ((.cse3 (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse2 (+ (select .cse3 .cse2) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse0 (select .cse1 .cse2))) (or (= (mod .cse0 2) 0) (not (< .cse0 0)) (< (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_99|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse7 (store (let ((.cse8 (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse2 (+ (select .cse8 .cse2) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse6 2) 0) (< (select .cse7 .cse2) 0) (<= 0 .cse6))))))))) (or (let ((.cse9 (select .cse11 0)) (.cse10 (select .cse11 .cse2))) (and (<= .cse9 1) (<= .cse10 1) (<= 1 .cse9) (<= 1 .cse10))) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse12 (store (let ((.cse14 (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse2 (+ (select .cse14 .cse2) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse13 (select .cse12 .cse2))) (or (= (mod (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (mod .cse13 2)) (< .cse13 0))))))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse15 (store (let ((.cse17 (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse2 (+ (select .cse17 .cse2) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse16 (mod (select .cse15 .cse2) 2))) (or (= (mod (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse16) (not (= .cse16 0)))))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_99|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse19 (store (let ((.cse20 (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse20 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse2 (+ (select .cse20 .cse2) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse18 (select .cse19 .cse2))) (or (= (mod .cse18 2) 0) (not (< .cse18 0)) (not (= (mod (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0)))))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse11 (+ .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))) is different from false [2022-11-02 20:53:28,450 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (store .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (and (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (forall ((v_ArrVal_207 Int)) (let ((.cse3 (store (let ((.cse5 (store .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse4 (+ (select .cse5 .cse4) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse2 (select .cse3 .cse4))) (or (not (< .cse2 0)) (= (mod .cse2 2) 0) (not (= (mod (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0)))))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)))))) (<= (+ (div (- |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 1) |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse8 (store (let ((.cse9 (store .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse4 (+ (select .cse9 .cse4) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse7 (select .cse8 .cse4))) (or (< .cse7 0) (= (mod (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (mod .cse7 2)))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse10 (store (let ((.cse12 (store .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse4 (+ (select .cse12 .cse4) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse11 (mod (select .cse10 .cse4) 2))) (or (= (mod (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse11) (not (= .cse11 0)))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse13 (store (let ((.cse15 (store .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse4 (+ (select .cse15 .cse4) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (select .cse13 .cse4) 0) (<= 0 .cse14) (= (mod .cse14 2) 0))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_95| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_95|)) (forall ((v_ArrVal_207 Int)) (let ((.cse17 (store (let ((.cse18 (store .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201))) (store (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse4 (+ (select .cse18 .cse4) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_95| 4)) v_ArrVal_207))) (let ((.cse16 (select .cse17 .cse4))) (or (not (< .cse16 0)) (< (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (= (mod .cse16 2) 0))))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false