./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-sorted-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:20:05,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:20:05,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:20:05,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:20:05,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:20:05,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:20:05,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:20:05,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:20:05,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:20:05,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:20:05,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:20:05,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:20:05,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:20:05,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:20:05,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:20:05,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:20:05,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:20:05,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:20:05,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:20:05,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:20:05,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:20:05,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:20:05,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:20:05,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:20:05,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:20:05,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:20:05,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:20:05,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:20:05,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:20:06,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:20:06,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:20:06,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:20:06,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:20:06,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:20:06,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:20:06,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:20:06,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:20:06,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:20:06,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:20:06,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:20:06,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:20:06,013 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-10-21 19:20:06,046 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:20:06,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:20:06,047 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:20:06,047 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:20:06,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:20:06,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:20:06,049 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:20:06,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:20:06,050 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:20:06,050 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 19:20:06,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:20:06,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:20:06,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:20:06,051 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-21 19:20:06,052 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-21 19:20:06,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:20:06,052 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-21 19:20:06,052 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:20:06,053 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:20:06,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:20:06,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:20:06,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:20:06,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:20:06,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:20:06,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:20:06,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:20:06,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 19:20:06,055 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:20:06,056 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_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/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_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be 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 valid-memcleanup) ) 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 -> 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 [2021-10-21 19:20:06,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:20:06,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:20:06,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:20:06,374 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:20:06,375 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:20:06,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/forester-heap/dll-sorted-1.i [2021-10-21 19:20:06,487 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/data/e718b1cee/a45b54c9b6304022947a49b24cff1684/FLAG8a0eebf65 [2021-10-21 19:20:07,148 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:20:07,149 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/sv-benchmarks/c/forester-heap/dll-sorted-1.i [2021-10-21 19:20:07,180 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/data/e718b1cee/a45b54c9b6304022947a49b24cff1684/FLAG8a0eebf65 [2021-10-21 19:20:07,417 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/data/e718b1cee/a45b54c9b6304022947a49b24cff1684 [2021-10-21 19:20:07,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:20:07,423 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-21 19:20:07,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:20:07,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:20:07,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:20:07,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69074d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07, skipping insertion in model container [2021-10-21 19:20:07,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:20:07,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:20:07,822 WARN L228 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_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22384,22397] [2021-10-21 19:20:07,828 WARN L228 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_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22614,22627] [2021-10-21 19:20:07,833 WARN L228 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_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22989,23002] [2021-10-21 19:20:07,835 WARN L228 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_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23053,23066] [2021-10-21 19:20:07,837 WARN L228 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_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23184,23197] [2021-10-21 19:20:07,838 WARN L228 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_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23248,23261] [2021-10-21 19:20:07,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:20:07,853 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:20:07,895 WARN L228 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_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22384,22397] [2021-10-21 19:20:07,897 WARN L228 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_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22614,22627] [2021-10-21 19:20:07,902 WARN L228 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_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22989,23002] [2021-10-21 19:20:07,903 WARN L228 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_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23053,23066] [2021-10-21 19:20:07,905 WARN L228 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_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23184,23197] [2021-10-21 19:20:07,906 WARN L228 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_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23248,23261] [2021-10-21 19:20:07,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:20:07,948 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:20:07,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07 WrapperNode [2021-10-21 19:20:07,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:20:07,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:20:07,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:20:07,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:20:07,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:08,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:08,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:08,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:08,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:20:08,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:20:08,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:20:08,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:20:08,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:08,055 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:20:08,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:20:08,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 19:20:08,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 19:20:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-21 19:20:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:20:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-21 19:20:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-21 19:20:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-10-21 19:20:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-10-21 19:20:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-10-21 19:20:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-10-21 19:20:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-10-21 19:20:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-10-21 19:20:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-10-21 19:20:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-10-21 19:20:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-10-21 19:20:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-10-21 19:20:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-10-21 19:20:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-10-21 19:20:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-10-21 19:20:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-10-21 19:20:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-10-21 19:20:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-10-21 19:20:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-10-21 19:20:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-10-21 19:20:08,154 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-10-21 19:20:08,154 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-10-21 19:20:08,154 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-10-21 19:20:08,154 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-10-21 19:20:08,154 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-10-21 19:20:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-10-21 19:20:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-10-21 19:20:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-10-21 19:20:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-10-21 19:20:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-10-21 19:20:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-10-21 19:20:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-10-21 19:20:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-10-21 19:20:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-10-21 19:20:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-10-21 19:20:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-10-21 19:20:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-10-21 19:20:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-10-21 19:20:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-10-21 19:20:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-10-21 19:20:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-10-21 19:20:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-10-21 19:20:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-10-21 19:20:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-10-21 19:20:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-10-21 19:20:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-10-21 19:20:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-10-21 19:20:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-10-21 19:20:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-10-21 19:20:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-10-21 19:20:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-10-21 19:20:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-10-21 19:20:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-10-21 19:20:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-10-21 19:20:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-10-21 19:20:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-10-21 19:20:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-10-21 19:20:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-10-21 19:20:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-10-21 19:20:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-10-21 19:20:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-10-21 19:20:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-21 19:20:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-10-21 19:20:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-10-21 19:20:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-10-21 19:20:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-10-21 19:20:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-10-21 19:20:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-10-21 19:20:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-10-21 19:20:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-10-21 19:20:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-10-21 19:20:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-10-21 19:20:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-10-21 19:20:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-10-21 19:20:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-10-21 19:20:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-10-21 19:20:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-10-21 19:20:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-10-21 19:20:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-10-21 19:20:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-10-21 19:20:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-10-21 19:20:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-10-21 19:20:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-10-21 19:20:08,167 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-10-21 19:20:08,167 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-10-21 19:20:08,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-10-21 19:20:08,167 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-10-21 19:20:08,167 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-10-21 19:20:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-10-21 19:20:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-10-21 19:20:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-10-21 19:20:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-10-21 19:20:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-10-21 19:20:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-10-21 19:20:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-10-21 19:20:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-10-21 19:20:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-10-21 19:20:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-10-21 19:20:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-10-21 19:20:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-10-21 19:20:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-10-21 19:20:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-10-21 19:20:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-10-21 19:20:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-10-21 19:20:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-10-21 19:20:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-21 19:20:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-21 19:20:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-10-21 19:20:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-10-21 19:20:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-21 19:20:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:20:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-21 19:20:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-21 19:20:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-21 19:20:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-21 19:20:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-21 19:20:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-21 19:20:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-21 19:20:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-21 19:20:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:20:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:20:09,156 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:20:09,158 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-10-21 19:20:09,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:20:09 BoogieIcfgContainer [2021-10-21 19:20:09,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:20:09,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 19:20:09,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 19:20:09,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 19:20:09,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 07:20:07" (1/3) ... [2021-10-21 19:20:09,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1528d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:20:09, skipping insertion in model container [2021-10-21 19:20:09,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (2/3) ... [2021-10-21 19:20:09,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1528d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:20:09, skipping insertion in model container [2021-10-21 19:20:09,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:20:09" (3/3) ... [2021-10-21 19:20:09,181 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-sorted-1.i [2021-10-21 19:20:09,191 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 19:20:09,192 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-10-21 19:20:09,247 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 19:20:09,255 INFO L339 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 19:20:09,256 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-10-21 19:20:09,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 99 states have (on average 2.1717171717171717) internal successors, (215), 179 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-21 19:20:09,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-21 19:20:09,293 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:09,294 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:09,294 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:09,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:09,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1404346321, now seen corresponding path program 1 times [2021-10-21 19:20:09,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:09,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213281854] [2021-10-21 19:20:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:09,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:09,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:09,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:09,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213281854] [2021-10-21 19:20:09,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213281854] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:09,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:09,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:20:09,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914744350] [2021-10-21 19:20:09,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:20:09,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:09,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:20:09,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:20:09,690 INFO L87 Difference]: Start difference. First operand has 184 states, 99 states have (on average 2.1717171717171717) internal successors, (215), 179 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:10,233 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2021-10-21 19:20:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:20:10,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-10-21 19:20:10,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:10,253 INFO L225 Difference]: With dead ends: 186 [2021-10-21 19:20:10,254 INFO L226 Difference]: Without dead ends: 182 [2021-10-21 19:20:10,257 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:20:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-10-21 19:20:10,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2021-10-21 19:20:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 98 states have (on average 1.8979591836734695) internal successors, (186), 174 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 189 transitions. [2021-10-21 19:20:10,345 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 189 transitions. Word has length 7 [2021-10-21 19:20:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:10,346 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 189 transitions. [2021-10-21 19:20:10,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 189 transitions. [2021-10-21 19:20:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-21 19:20:10,347 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:10,347 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:10,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 19:20:10,347 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:10,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:10,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1404346320, now seen corresponding path program 1 times [2021-10-21 19:20:10,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:10,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145872814] [2021-10-21 19:20:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:10,349 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:10,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:10,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:10,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145872814] [2021-10-21 19:20:10,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145872814] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:10,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:10,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:20:10,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920833697] [2021-10-21 19:20:10,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:20:10,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:10,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:20:10,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:20:10,526 INFO L87 Difference]: Start difference. First operand 178 states and 189 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:10,937 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2021-10-21 19:20:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:20:10,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-10-21 19:20:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:10,940 INFO L225 Difference]: With dead ends: 179 [2021-10-21 19:20:10,940 INFO L226 Difference]: Without dead ends: 179 [2021-10-21 19:20:10,941 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:20:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-10-21 19:20:10,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2021-10-21 19:20:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 98 states have (on average 1.8673469387755102) internal successors, (183), 171 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 186 transitions. [2021-10-21 19:20:10,964 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 186 transitions. Word has length 7 [2021-10-21 19:20:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:10,964 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 186 transitions. [2021-10-21 19:20:10,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 186 transitions. [2021-10-21 19:20:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-21 19:20:10,965 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:10,965 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:10,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 19:20:10,966 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr7REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:10,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash -155484519, now seen corresponding path program 1 times [2021-10-21 19:20:10,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:10,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836727162] [2021-10-21 19:20:10,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:10,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:11,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:11,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:11,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836727162] [2021-10-21 19:20:11,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836727162] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:11,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:11,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:20:11,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602218077] [2021-10-21 19:20:11,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:20:11,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:11,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:20:11,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:20:11,228 INFO L87 Difference]: Start difference. First operand 175 states and 186 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:11,808 INFO L93 Difference]: Finished difference Result 289 states and 309 transitions. [2021-10-21 19:20:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:20:11,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-10-21 19:20:11,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:11,812 INFO L225 Difference]: With dead ends: 289 [2021-10-21 19:20:11,812 INFO L226 Difference]: Without dead ends: 289 [2021-10-21 19:20:11,813 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 65.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:20:11,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-21 19:20:11,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 234. [2021-10-21 19:20:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 157 states have (on average 1.8535031847133758) internal successors, (291), 230 states have internal predecessors, (291), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 294 transitions. [2021-10-21 19:20:11,829 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 294 transitions. Word has length 13 [2021-10-21 19:20:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:11,829 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 294 transitions. [2021-10-21 19:20:11,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2021-10-21 19:20:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-21 19:20:11,831 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:11,831 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:11,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 19:20:11,831 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr6REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:11,832 INFO L82 PathProgramCache]: Analyzing trace with hash -155484520, now seen corresponding path program 1 times [2021-10-21 19:20:11,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:11,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743462073] [2021-10-21 19:20:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:11,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:11,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:11,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:11,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743462073] [2021-10-21 19:20:11,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743462073] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:11,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:11,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:20:11,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248026753] [2021-10-21 19:20:11,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:20:11,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:11,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:20:11,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:20:11,942 INFO L87 Difference]: Start difference. First operand 234 states and 294 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:12,279 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2021-10-21 19:20:12,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:20:12,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-10-21 19:20:12,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:12,283 INFO L225 Difference]: With dead ends: 232 [2021-10-21 19:20:12,283 INFO L226 Difference]: Without dead ends: 232 [2021-10-21 19:20:12,283 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:20:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-10-21 19:20:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 224. [2021-10-21 19:20:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 165 states have (on average 1.612121212121212) internal successors, (266), 220 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 269 transitions. [2021-10-21 19:20:12,298 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 269 transitions. Word has length 13 [2021-10-21 19:20:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:12,298 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 269 transitions. [2021-10-21 19:20:12,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 269 transitions. [2021-10-21 19:20:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-21 19:20:12,299 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:12,300 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:12,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 19:20:12,300 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr20ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:12,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:12,301 INFO L82 PathProgramCache]: Analyzing trace with hash 903211970, now seen corresponding path program 1 times [2021-10-21 19:20:12,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:12,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323166198] [2021-10-21 19:20:12,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:12,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:12,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:12,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:12,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323166198] [2021-10-21 19:20:12,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323166198] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:12,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:12,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:20:12,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672516146] [2021-10-21 19:20:12,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:20:12,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:12,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:20:12,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:20:12,377 INFO L87 Difference]: Start difference. First operand 224 states and 269 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:12,604 INFO L93 Difference]: Finished difference Result 270 states and 319 transitions. [2021-10-21 19:20:12,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:20:12,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-10-21 19:20:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:12,606 INFO L225 Difference]: With dead ends: 270 [2021-10-21 19:20:12,607 INFO L226 Difference]: Without dead ends: 270 [2021-10-21 19:20:12,607 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:20:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-21 19:20:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 237. [2021-10-21 19:20:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 178 states have (on average 1.6067415730337078) internal successors, (286), 233 states have internal predecessors, (286), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 289 transitions. [2021-10-21 19:20:12,620 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 289 transitions. Word has length 15 [2021-10-21 19:20:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:12,620 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 289 transitions. [2021-10-21 19:20:12,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 289 transitions. [2021-10-21 19:20:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-21 19:20:12,621 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:12,621 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:12,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 19:20:12,622 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:12,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:12,622 INFO L82 PathProgramCache]: Analyzing trace with hash -2064587218, now seen corresponding path program 1 times [2021-10-21 19:20:12,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:12,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934594782] [2021-10-21 19:20:12,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:12,623 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:12,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:12,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:12,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934594782] [2021-10-21 19:20:12,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934594782] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:12,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:12,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:20:12,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315181888] [2021-10-21 19:20:12,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:20:12,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:12,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:20:12,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:20:12,712 INFO L87 Difference]: Start difference. First operand 237 states and 289 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:13,057 INFO L93 Difference]: Finished difference Result 236 states and 286 transitions. [2021-10-21 19:20:13,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:20:13,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-10-21 19:20:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:13,062 INFO L225 Difference]: With dead ends: 236 [2021-10-21 19:20:13,062 INFO L226 Difference]: Without dead ends: 236 [2021-10-21 19:20:13,062 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:20:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-10-21 19:20:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-10-21 19:20:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 178 states have (on average 1.5898876404494382) internal successors, (283), 232 states have internal predecessors, (283), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 286 transitions. [2021-10-21 19:20:13,069 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 286 transitions. Word has length 16 [2021-10-21 19:20:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:13,069 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 286 transitions. [2021-10-21 19:20:13,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 286 transitions. [2021-10-21 19:20:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-21 19:20:13,070 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:13,070 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:13,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 19:20:13,070 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:13,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:13,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2064587217, now seen corresponding path program 1 times [2021-10-21 19:20:13,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:13,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361030372] [2021-10-21 19:20:13,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:13,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:13,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:13,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:13,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361030372] [2021-10-21 19:20:13,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361030372] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:13,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:13,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:20:13,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067494137] [2021-10-21 19:20:13,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:20:13,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:13,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:20:13,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:20:13,171 INFO L87 Difference]: Start difference. First operand 236 states and 286 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:13,543 INFO L93 Difference]: Finished difference Result 235 states and 283 transitions. [2021-10-21 19:20:13,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:20:13,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-10-21 19:20:13,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:13,545 INFO L225 Difference]: With dead ends: 235 [2021-10-21 19:20:13,545 INFO L226 Difference]: Without dead ends: 235 [2021-10-21 19:20:13,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 56.8ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:20:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-10-21 19:20:13,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2021-10-21 19:20:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.5730337078651686) internal successors, (280), 231 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 283 transitions. [2021-10-21 19:20:13,552 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 283 transitions. Word has length 16 [2021-10-21 19:20:13,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:13,553 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 283 transitions. [2021-10-21 19:20:13,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 283 transitions. [2021-10-21 19:20:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-21 19:20:13,554 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:13,554 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:13,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 19:20:13,554 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:13,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:13,555 INFO L82 PathProgramCache]: Analyzing trace with hash 949671408, now seen corresponding path program 1 times [2021-10-21 19:20:13,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:13,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013258012] [2021-10-21 19:20:13,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:13,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:13,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:13,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:13,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013258012] [2021-10-21 19:20:13,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013258012] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:13,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:13,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 19:20:13,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955026602] [2021-10-21 19:20:13,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:20:13,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:13,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:20:13,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:20:13,700 INFO L87 Difference]: Start difference. First operand 235 states and 283 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:14,325 INFO L93 Difference]: Finished difference Result 242 states and 284 transitions. [2021-10-21 19:20:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:20:14,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-10-21 19:20:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:14,327 INFO L225 Difference]: With dead ends: 242 [2021-10-21 19:20:14,327 INFO L226 Difference]: Without dead ends: 242 [2021-10-21 19:20:14,328 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 149.3ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:20:14,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-10-21 19:20:14,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 234. [2021-10-21 19:20:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 178 states have (on average 1.5617977528089888) internal successors, (278), 230 states have internal predecessors, (278), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 281 transitions. [2021-10-21 19:20:14,336 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 281 transitions. Word has length 20 [2021-10-21 19:20:14,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:14,336 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 281 transitions. [2021-10-21 19:20:14,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 281 transitions. [2021-10-21 19:20:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-21 19:20:14,337 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:14,337 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:14,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 19:20:14,338 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr15REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:14,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:14,338 INFO L82 PathProgramCache]: Analyzing trace with hash 949671409, now seen corresponding path program 1 times [2021-10-21 19:20:14,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:14,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436768249] [2021-10-21 19:20:14,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:14,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:14,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:14,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:14,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436768249] [2021-10-21 19:20:14,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436768249] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:14,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:14,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:20:14,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487146444] [2021-10-21 19:20:14,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:20:14,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:14,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:20:14,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:20:14,597 INFO L87 Difference]: Start difference. First operand 234 states and 281 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:15,544 INFO L93 Difference]: Finished difference Result 237 states and 275 transitions. [2021-10-21 19:20:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-21 19:20:15,544 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-10-21 19:20:15,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:15,546 INFO L225 Difference]: With dead ends: 237 [2021-10-21 19:20:15,547 INFO L226 Difference]: Without dead ends: 237 [2021-10-21 19:20:15,547 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 438.6ms TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-10-21 19:20:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-10-21 19:20:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 220. [2021-10-21 19:20:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 170 states have (on average 1.5294117647058822) internal successors, (260), 216 states have internal predecessors, (260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 263 transitions. [2021-10-21 19:20:15,557 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 263 transitions. Word has length 20 [2021-10-21 19:20:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:15,557 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 263 transitions. [2021-10-21 19:20:15,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:15,558 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 263 transitions. [2021-10-21 19:20:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-21 19:20:15,559 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:15,559 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:15,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 19:20:15,560 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr20ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:15,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:15,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1432225935, now seen corresponding path program 1 times [2021-10-21 19:20:15,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:15,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606612485] [2021-10-21 19:20:15,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:15,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:15,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-21 19:20:15,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:15,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606612485] [2021-10-21 19:20:15,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606612485] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:15,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:15,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:20:15,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532975195] [2021-10-21 19:20:15,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:20:15,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:15,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:20:15,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:20:15,684 INFO L87 Difference]: Start difference. First operand 220 states and 263 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:16,019 INFO L93 Difference]: Finished difference Result 258 states and 281 transitions. [2021-10-21 19:20:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:20:16,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-10-21 19:20:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:16,022 INFO L225 Difference]: With dead ends: 258 [2021-10-21 19:20:16,023 INFO L226 Difference]: Without dead ends: 258 [2021-10-21 19:20:16,023 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:20:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-10-21 19:20:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 218. [2021-10-21 19:20:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 169 states have (on average 1.514792899408284) internal successors, (256), 214 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 259 transitions. [2021-10-21 19:20:16,031 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 259 transitions. Word has length 29 [2021-10-21 19:20:16,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:16,032 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 259 transitions. [2021-10-21 19:20:16,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 259 transitions. [2021-10-21 19:20:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-21 19:20:16,034 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:16,034 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:16,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 19:20:16,035 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:16,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:16,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1716077152, now seen corresponding path program 1 times [2021-10-21 19:20:16,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:16,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142821974] [2021-10-21 19:20:16,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:16,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:16,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:16,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:16,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142821974] [2021-10-21 19:20:16,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142821974] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:20:16,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729969701] [2021-10-21 19:20:16,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:16,400 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:20:16,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:20:16,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:20:16,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-21 19:20:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:16,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 27 conjunts are in the unsatisfiable core [2021-10-21 19:20:16,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:20:16,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-21 19:20:16,934 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-10-21 19:20:16,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-10-21 19:20:17,027 INFO L388 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 21 treesize of output 17 [2021-10-21 19:20:17,220 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-21 19:20:17,220 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2021-10-21 19:20:17,691 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-10-21 19:20:17,691 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 48 [2021-10-21 19:20:17,929 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-10-21 19:20:17,929 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 45 [2021-10-21 19:20:18,431 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-10-21 19:20:18,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 33 [2021-10-21 19:20:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:18,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729969701] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:20:18,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:20:18,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-10-21 19:20:18,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661673018] [2021-10-21 19:20:18,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-10-21 19:20:18,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:18,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-10-21 19:20:18,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2021-10-21 19:20:18,493 INFO L87 Difference]: Start difference. First operand 218 states and 259 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:21,114 INFO L93 Difference]: Finished difference Result 423 states and 480 transitions. [2021-10-21 19:20:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-21 19:20:21,116 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-10-21 19:20:21,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:21,119 INFO L225 Difference]: With dead ends: 423 [2021-10-21 19:20:21,119 INFO L226 Difference]: Without dead ends: 423 [2021-10-21 19:20:21,121 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1712.2ms TimeCoverageRelationStatistics Valid=376, Invalid=1786, Unknown=0, NotChecked=0, Total=2162 [2021-10-21 19:20:21,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-10-21 19:20:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 243. [2021-10-21 19:20:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 194 states have (on average 1.4690721649484537) internal successors, (285), 239 states have internal predecessors, (285), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 288 transitions. [2021-10-21 19:20:21,134 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 288 transitions. Word has length 35 [2021-10-21 19:20:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:21,136 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 288 transitions. [2021-10-21 19:20:21,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 288 transitions. [2021-10-21 19:20:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-21 19:20:21,150 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:21,151 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:21,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-21 19:20:21,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:20:21,379 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr26REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:21,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:21,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1716077151, now seen corresponding path program 1 times [2021-10-21 19:20:21,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:21,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111072770] [2021-10-21 19:20:21,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:21,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:21,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:21,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:21,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111072770] [2021-10-21 19:20:21,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111072770] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:20:21,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55355016] [2021-10-21 19:20:21,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:21,881 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:20:21,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:20:21,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:20:21,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-21 19:20:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:22,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 35 conjunts are in the unsatisfiable core [2021-10-21 19:20:22,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:20:22,448 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-10-21 19:20:22,448 INFO L388 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 1 case distinctions, treesize of input 19 treesize of output 18 [2021-10-21 19:20:22,481 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-10-21 19:20:22,482 INFO L388 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 1 case distinctions, treesize of input 19 treesize of output 26 [2021-10-21 19:20:22,767 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-10-21 19:20:22,768 INFO L388 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 90 [2021-10-21 19:20:22,800 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-21 19:20:22,801 INFO L388 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 87 treesize of output 66 [2021-10-21 19:20:23,860 INFO L354 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2021-10-21 19:20:23,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 81 [2021-10-21 19:20:23,876 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-10-21 19:20:23,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 47 [2021-10-21 19:20:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:23,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55355016] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:20:23,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:20:23,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2021-10-21 19:20:23,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567505275] [2021-10-21 19:20:23,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-21 19:20:23,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:23,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-21 19:20:23,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2021-10-21 19:20:23,938 INFO L87 Difference]: Start difference. First operand 243 states and 288 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:27,791 INFO L93 Difference]: Finished difference Result 435 states and 488 transitions. [2021-10-21 19:20:27,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-21 19:20:27,792 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-10-21 19:20:27,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:27,796 INFO L225 Difference]: With dead ends: 435 [2021-10-21 19:20:27,796 INFO L226 Difference]: Without dead ends: 435 [2021-10-21 19:20:27,797 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2767.9ms TimeCoverageRelationStatistics Valid=484, Invalid=1966, Unknown=0, NotChecked=0, Total=2450 [2021-10-21 19:20:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-10-21 19:20:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 244. [2021-10-21 19:20:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 240 states have internal predecessors, (285), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 288 transitions. [2021-10-21 19:20:27,808 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 288 transitions. Word has length 35 [2021-10-21 19:20:27,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:27,811 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 288 transitions. [2021-10-21 19:20:27,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 288 transitions. [2021-10-21 19:20:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:20:27,816 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:27,816 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:27,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-21 19:20:28,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:20:28,031 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr22REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:28,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:28,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1587295850, now seen corresponding path program 1 times [2021-10-21 19:20:28,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:28,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105232486] [2021-10-21 19:20:28,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:28,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:28,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:28,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:28,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105232486] [2021-10-21 19:20:28,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105232486] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:20:28,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350079810] [2021-10-21 19:20:28,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:28,526 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:20:28,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:20:28,534 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:20:28,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-21 19:20:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:28,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjunts are in the unsatisfiable core [2021-10-21 19:20:28,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:20:28,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-21 19:20:29,002 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-21 19:20:29,003 INFO L388 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 11 treesize of output 11 [2021-10-21 19:20:29,066 INFO L388 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 16 treesize of output 12 [2021-10-21 19:20:29,073 INFO L388 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 [2021-10-21 19:20:29,259 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-21 19:20:29,259 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 44 [2021-10-21 19:20:29,278 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-21 19:20:29,279 INFO L388 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 1 case distinctions, treesize of input 50 treesize of output 45 [2021-10-21 19:20:29,425 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-10-21 19:20:29,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 23 [2021-10-21 19:20:29,584 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-10-21 19:20:29,584 INFO L388 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 28 treesize of output 30 [2021-10-21 19:20:31,808 INFO L354 Elim1Store]: treesize reduction 122, result has 19.7 percent of original size [2021-10-21 19:20:31,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 43 [2021-10-21 19:20:32,589 INFO L388 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 54 treesize of output 46 [2021-10-21 19:20:32,619 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-10-21 19:20:32,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 30 [2021-10-21 19:20:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:32,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350079810] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:20:32,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:20:32,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2021-10-21 19:20:32,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304183464] [2021-10-21 19:20:32,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-10-21 19:20:32,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:32,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-10-21 19:20:32,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2021-10-21 19:20:32,699 INFO L87 Difference]: Start difference. First operand 244 states and 288 transitions. Second operand has 33 states, 32 states have (on average 2.28125) internal successors, (73), 32 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:55,824 INFO L93 Difference]: Finished difference Result 460 states and 516 transitions. [2021-10-21 19:20:55,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-21 19:20:55,824 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 32 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-21 19:20:55,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:55,831 INFO L225 Difference]: With dead ends: 460 [2021-10-21 19:20:55,831 INFO L226 Difference]: Without dead ends: 460 [2021-10-21 19:20:55,834 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 13975.1ms TimeCoverageRelationStatistics Valid=613, Invalid=3415, Unknown=4, NotChecked=0, Total=4032 [2021-10-21 19:20:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-10-21 19:20:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 249. [2021-10-21 19:20:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 200 states have (on average 1.46) internal successors, (292), 245 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 295 transitions. [2021-10-21 19:20:55,849 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 295 transitions. Word has length 40 [2021-10-21 19:20:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:55,850 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 295 transitions. [2021-10-21 19:20:55,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 32 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 295 transitions. [2021-10-21 19:20:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:20:55,852 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:55,852 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:55,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-21 19:20:56,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-21 19:20:56,073 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:56,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1587295851, now seen corresponding path program 1 times [2021-10-21 19:20:56,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:56,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678437182] [2021-10-21 19:20:56,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:56,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:56,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-21 19:20:56,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:56,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678437182] [2021-10-21 19:20:56,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678437182] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:56,142 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:56,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:20:56,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782862604] [2021-10-21 19:20:56,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:20:56,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:56,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:20:56,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:20:56,144 INFO L87 Difference]: Start difference. First operand 249 states and 295 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:56,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:56,564 INFO L93 Difference]: Finished difference Result 283 states and 335 transitions. [2021-10-21 19:20:56,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:20:56,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-21 19:20:56,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:56,565 INFO L225 Difference]: With dead ends: 283 [2021-10-21 19:20:56,566 INFO L226 Difference]: Without dead ends: 283 [2021-10-21 19:20:56,566 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 54.8ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:20:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-10-21 19:20:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 254. [2021-10-21 19:20:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 205 states have (on average 1.4634146341463414) internal successors, (300), 250 states have internal predecessors, (300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 303 transitions. [2021-10-21 19:20:56,596 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 303 transitions. Word has length 40 [2021-10-21 19:20:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:56,597 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 303 transitions. [2021-10-21 19:20:56,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 303 transitions. [2021-10-21 19:20:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:20:56,599 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:56,599 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:56,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 19:20:56,601 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr36REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:56,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:56,602 INFO L82 PathProgramCache]: Analyzing trace with hash -371074441, now seen corresponding path program 1 times [2021-10-21 19:20:56,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:56,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693135926] [2021-10-21 19:20:56,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:56,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:56,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-21 19:20:56,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:56,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693135926] [2021-10-21 19:20:56,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693135926] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:56,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:56,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:20:56,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790874242] [2021-10-21 19:20:56,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:20:56,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:56,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:20:56,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:20:56,727 INFO L87 Difference]: Start difference. First operand 254 states and 303 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:57,064 INFO L93 Difference]: Finished difference Result 272 states and 322 transitions. [2021-10-21 19:20:57,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:20:57,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-21 19:20:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:57,067 INFO L225 Difference]: With dead ends: 272 [2021-10-21 19:20:57,067 INFO L226 Difference]: Without dead ends: 272 [2021-10-21 19:20:57,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 87.0ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:20:57,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-10-21 19:20:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 262. [2021-10-21 19:20:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 213 states have (on average 1.4507042253521127) internal successors, (309), 258 states have internal predecessors, (309), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 312 transitions. [2021-10-21 19:20:57,074 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 312 transitions. Word has length 40 [2021-10-21 19:20:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:57,075 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 312 transitions. [2021-10-21 19:20:57,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 312 transitions. [2021-10-21 19:20:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:20:57,075 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:57,076 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:57,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 19:20:57,076 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr36REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:57,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:57,076 INFO L82 PathProgramCache]: Analyzing trace with hash -371014859, now seen corresponding path program 1 times [2021-10-21 19:20:57,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:57,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880436243] [2021-10-21 19:20:57,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:57,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:57,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-21 19:20:57,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:57,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880436243] [2021-10-21 19:20:57,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880436243] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:57,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:57,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:20:57,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831743167] [2021-10-21 19:20:57,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:20:57,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:57,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:20:57,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:20:57,129 INFO L87 Difference]: Start difference. First operand 262 states and 312 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:57,329 INFO L93 Difference]: Finished difference Result 259 states and 304 transitions. [2021-10-21 19:20:57,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:20:57,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-21 19:20:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:57,331 INFO L225 Difference]: With dead ends: 259 [2021-10-21 19:20:57,331 INFO L226 Difference]: Without dead ends: 259 [2021-10-21 19:20:57,332 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:20:57,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-10-21 19:20:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2021-10-21 19:20:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 213 states have (on average 1.4131455399061033) internal successors, (301), 254 states have internal predecessors, (301), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 304 transitions. [2021-10-21 19:20:57,338 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 304 transitions. Word has length 40 [2021-10-21 19:20:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:57,338 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 304 transitions. [2021-10-21 19:20:57,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 304 transitions. [2021-10-21 19:20:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:20:57,340 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:57,340 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:57,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 19:20:57,340 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr37REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:57,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash -371014858, now seen corresponding path program 1 times [2021-10-21 19:20:57,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:57,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814662383] [2021-10-21 19:20:57,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:57,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:57,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-21 19:20:57,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:57,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814662383] [2021-10-21 19:20:57,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814662383] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:57,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:57,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:20:57,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585482198] [2021-10-21 19:20:57,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:20:57,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:57,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:20:57,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:20:57,398 INFO L87 Difference]: Start difference. First operand 258 states and 304 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:57,599 INFO L93 Difference]: Finished difference Result 254 states and 296 transitions. [2021-10-21 19:20:57,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:20:57,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-21 19:20:57,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:57,601 INFO L225 Difference]: With dead ends: 254 [2021-10-21 19:20:57,601 INFO L226 Difference]: Without dead ends: 254 [2021-10-21 19:20:57,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:20:57,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-10-21 19:20:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2021-10-21 19:20:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 213 states have (on average 1.375586854460094) internal successors, (293), 250 states have internal predecessors, (293), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 296 transitions. [2021-10-21 19:20:57,608 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 296 transitions. Word has length 40 [2021-10-21 19:20:57,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:57,609 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 296 transitions. [2021-10-21 19:20:57,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 296 transitions. [2021-10-21 19:20:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-21 19:20:57,610 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:57,610 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:57,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-21 19:20:57,610 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr33REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:57,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:57,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1524461310, now seen corresponding path program 1 times [2021-10-21 19:20:57,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:57,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176260360] [2021-10-21 19:20:57,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:57,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:57,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-21 19:20:57,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:57,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176260360] [2021-10-21 19:20:57,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176260360] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:57,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:57,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:20:57,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662233958] [2021-10-21 19:20:57,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:20:57,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:57,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:20:57,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:20:57,682 INFO L87 Difference]: Start difference. First operand 254 states and 296 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:58,077 INFO L93 Difference]: Finished difference Result 278 states and 320 transitions. [2021-10-21 19:20:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:20:58,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-10-21 19:20:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:58,079 INFO L225 Difference]: With dead ends: 278 [2021-10-21 19:20:58,079 INFO L226 Difference]: Without dead ends: 278 [2021-10-21 19:20:58,080 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 67.0ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:20:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-10-21 19:20:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 261. [2021-10-21 19:20:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 220 states have (on average 1.3863636363636365) internal successors, (305), 257 states have internal predecessors, (305), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 308 transitions. [2021-10-21 19:20:58,087 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 308 transitions. Word has length 44 [2021-10-21 19:20:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:58,087 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 308 transitions. [2021-10-21 19:20:58,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 308 transitions. [2021-10-21 19:20:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-21 19:20:58,088 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:58,089 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:58,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-21 19:20:58,089 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:58,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:58,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1524461309, now seen corresponding path program 1 times [2021-10-21 19:20:58,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:58,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822338907] [2021-10-21 19:20:58,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:58,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:58,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:58,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:58,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822338907] [2021-10-21 19:20:58,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822338907] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:20:58,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89828512] [2021-10-21 19:20:58,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:58,411 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:20:58,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:20:58,412 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:20:58,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-21 19:20:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:58,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjunts are in the unsatisfiable core [2021-10-21 19:20:58,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:20:58,866 INFO L388 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 39 treesize of output 31 [2021-10-21 19:20:58,869 INFO L388 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 28 treesize of output 16 [2021-10-21 19:20:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-21 19:20:58,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89828512] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:58,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-21 19:20:58,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2021-10-21 19:20:58,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867872988] [2021-10-21 19:20:58,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:20:58,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:58,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:20:58,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-10-21 19:20:58,933 INFO L87 Difference]: Start difference. First operand 261 states and 308 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:20:59,205 INFO L93 Difference]: Finished difference Result 274 states and 315 transitions. [2021-10-21 19:20:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:20:59,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-10-21 19:20:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:20:59,207 INFO L225 Difference]: With dead ends: 274 [2021-10-21 19:20:59,207 INFO L226 Difference]: Without dead ends: 274 [2021-10-21 19:20:59,207 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 305.5ms TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2021-10-21 19:20:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-10-21 19:20:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 259. [2021-10-21 19:20:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 220 states have (on average 1.3636363636363635) internal successors, (300), 255 states have internal predecessors, (300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:59,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 303 transitions. [2021-10-21 19:20:59,215 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 303 transitions. Word has length 44 [2021-10-21 19:20:59,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:20:59,215 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 303 transitions. [2021-10-21 19:20:59,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:20:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 303 transitions. [2021-10-21 19:20:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-21 19:20:59,216 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:20:59,216 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:59,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-21 19:20:59,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:20:59,434 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:20:59,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:59,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1353350043, now seen corresponding path program 1 times [2021-10-21 19:20:59,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:59,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147410666] [2021-10-21 19:20:59,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:59,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:20:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:59,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:59,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147410666] [2021-10-21 19:20:59,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147410666] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:20:59,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906824889] [2021-10-21 19:20:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:59,778 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:20:59,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:20:59,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:20:59,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-21 19:21:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:21:00,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjunts are in the unsatisfiable core [2021-10-21 19:21:00,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:21:00,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-21 19:21:00,208 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-21 19:21:00,209 INFO L388 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 11 treesize of output 11 [2021-10-21 19:21:00,250 INFO L388 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 [2021-10-21 19:21:00,276 INFO L388 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 16 treesize of output 12 [2021-10-21 19:21:00,409 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-21 19:21:00,411 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 44 [2021-10-21 19:21:00,422 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-21 19:21:00,422 INFO L388 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 1 case distinctions, treesize of input 50 treesize of output 45 [2021-10-21 19:21:00,714 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-10-21 19:21:00,715 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 77 [2021-10-21 19:21:00,733 INFO L354 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2021-10-21 19:21:00,733 INFO L388 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 80 treesize of output 78 [2021-10-21 19:21:00,894 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-21 19:21:00,895 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 65 [2021-10-21 19:21:00,906 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-21 19:21:00,906 INFO L388 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 65 treesize of output 44 [2021-10-21 19:21:01,541 INFO L354 Elim1Store]: treesize reduction 70, result has 9.1 percent of original size [2021-10-21 19:21:01,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 54 [2021-10-21 19:21:01,557 INFO L354 Elim1Store]: treesize reduction 54, result has 11.5 percent of original size [2021-10-21 19:21:01,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 32 [2021-10-21 19:21:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:21:01,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906824889] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:21:01,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:21:01,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2021-10-21 19:21:01,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551884891] [2021-10-21 19:21:01,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-21 19:21:01,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:21:01,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-21 19:21:01,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2021-10-21 19:21:01,590 INFO L87 Difference]: Start difference. First operand 259 states and 303 transitions. Second operand has 32 states, 32 states have (on average 2.40625) internal successors, (77), 31 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:21:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:21:05,332 INFO L93 Difference]: Finished difference Result 419 states and 473 transitions. [2021-10-21 19:21:05,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-10-21 19:21:05,340 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.40625) internal successors, (77), 31 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-10-21 19:21:05,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:21:05,342 INFO L225 Difference]: With dead ends: 419 [2021-10-21 19:21:05,343 INFO L226 Difference]: Without dead ends: 419 [2021-10-21 19:21:05,344 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 1662.0ms TimeCoverageRelationStatistics Valid=420, Invalid=2886, Unknown=0, NotChecked=0, Total=3306 [2021-10-21 19:21:05,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-10-21 19:21:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 256. [2021-10-21 19:21:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 218 states have (on average 1.3440366972477065) internal successors, (293), 252 states have internal predecessors, (293), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:21:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 296 transitions. [2021-10-21 19:21:05,352 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 296 transitions. Word has length 44 [2021-10-21 19:21:05,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:21:05,352 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 296 transitions. [2021-10-21 19:21:05,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.40625) internal successors, (77), 31 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:21:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 296 transitions. [2021-10-21 19:21:05,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-21 19:21:05,353 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:21:05,354 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:21:05,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-21 19:21:05,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:21:05,579 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr35ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:21:05,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:05,579 INFO L82 PathProgramCache]: Analyzing trace with hash -423467038, now seen corresponding path program 1 times [2021-10-21 19:21:05,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:05,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778726744] [2021-10-21 19:21:05,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:05,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:05,613 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:21:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:05,689 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:21:05,689 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-21 19:21:05,690 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr35ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:21:05,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-10-21 19:21:05,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-10-21 19:21:05,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-10-21 19:21:05,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-10-21 19:21:05,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-10-21 19:21:05,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-10-21 19:21:05,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-10-21 19:21:05,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-10-21 19:21:05,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-10-21 19:21:05,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-10-21 19:21:05,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-10-21 19:21:05,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-10-21 19:21:05,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-10-21 19:21:05,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-10-21 19:21:05,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-10-21 19:21:05,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-10-21 19:21:05,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-10-21 19:21:05,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-10-21 19:21:05,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-10-21 19:21:05,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-10-21 19:21:05,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:21:05,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-10-21 19:21:05,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-10-21 19:21:05,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-10-21 19:21:05,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-10-21 19:21:05,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-10-21 19:21:05,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-10-21 19:21:05,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-10-21 19:21:05,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-10-21 19:21:05,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-10-21 19:21:05,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-10-21 19:21:05,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-10-21 19:21:05,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-10-21 19:21:05,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-10-21 19:21:05,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-10-21 19:21:05,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-10-21 19:21:05,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-10-21 19:21:05,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-10-21 19:21:05,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-10-21 19:21:05,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-10-21 19:21:05,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-10-21 19:21:05,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-10-21 19:21:05,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-10-21 19:21:05,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44REQUIRES_VIOLATION [2021-10-21 19:21:05,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION [2021-10-21 19:21:05,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-10-21 19:21:05,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-10-21 19:21:05,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION [2021-10-21 19:21:05,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-10-21 19:21:05,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-10-21 19:21:05,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51REQUIRES_VIOLATION [2021-10-21 19:21:05,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-10-21 19:21:05,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-10-21 19:21:05,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION [2021-10-21 19:21:05,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-10-21 19:21:05,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION [2021-10-21 19:21:05,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57REQUIRES_VIOLATION [2021-10-21 19:21:05,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-10-21 19:21:05,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-10-21 19:21:05,702 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-10-21 19:21:05,702 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-10-21 19:21:05,702 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:21:05,702 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:21:05,702 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64REQUIRES_VIOLATION [2021-10-21 19:21:05,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-10-21 19:21:05,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-10-21 19:21:05,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67REQUIRES_VIOLATION [2021-10-21 19:21:05,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68REQUIRES_VIOLATION [2021-10-21 19:21:05,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION [2021-10-21 19:21:05,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:21:05,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:21:05,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72REQUIRES_VIOLATION [2021-10-21 19:21:05,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73REQUIRES_VIOLATION [2021-10-21 19:21:05,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74REQUIRES_VIOLATION [2021-10-21 19:21:05,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75REQUIRES_VIOLATION [2021-10-21 19:21:05,705 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:21:05,705 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:21:05,705 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:21:05,705 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79ENSURES_VIOLATIONMEMORY_LEAK [2021-10-21 19:21:05,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-21 19:21:05,719 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 19:21:05,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 07:21:05 BoogieIcfgContainer [2021-10-21 19:21:05,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 19:21:05,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:21:05,776 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:21:05,777 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:21:05,777 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:20:09" (3/4) ... [2021-10-21 19:21:05,779 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-21 19:21:05,835 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:21:05,835 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:21:05,836 INFO L168 Benchmark]: Toolchain (without parser) took 58413.28 ms. Allocated memory was 107.0 MB in the beginning and 207.6 MB in the end (delta: 100.7 MB). Free memory was 74.3 MB in the beginning and 120.5 MB in the end (delta: -46.2 MB). Peak memory consumption was 54.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:21:05,837 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 107.0 MB. Free memory is still 62.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:21:05,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 514.38 ms. Allocated memory was 107.0 MB in the beginning and 138.4 MB in the end (delta: 31.5 MB). Free memory was 74.0 MB in the beginning and 105.5 MB in the end (delta: -31.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:21:05,837 INFO L168 Benchmark]: Boogie Preprocessor took 85.48 ms. Allocated memory is still 138.4 MB. Free memory was 105.5 MB in the beginning and 102.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:21:05,838 INFO L168 Benchmark]: RCFGBuilder took 1125.90 ms. Allocated memory is still 138.4 MB. Free memory was 102.0 MB in the beginning and 71.9 MB in the end (delta: 30.0 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:21:05,838 INFO L168 Benchmark]: TraceAbstraction took 56608.96 ms. Allocated memory was 138.4 MB in the beginning and 207.6 MB in the end (delta: 69.2 MB). Free memory was 71.2 MB in the beginning and 123.6 MB in the end (delta: -52.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-21 19:21:05,839 INFO L168 Benchmark]: Witness Printer took 59.13 ms. Allocated memory is still 207.6 MB. Free memory was 123.6 MB in the beginning and 120.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 19:21:05,840 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 107.0 MB. Free memory is still 62.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 514.38 ms. Allocated memory was 107.0 MB in the beginning and 138.4 MB in the end (delta: 31.5 MB). Free memory was 74.0 MB in the beginning and 105.5 MB in the end (delta: -31.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 85.48 ms. Allocated memory is still 138.4 MB. Free memory was 105.5 MB in the beginning and 102.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1125.90 ms. Allocated memory is still 138.4 MB. Free memory was 102.0 MB in the beginning and 71.9 MB in the end (delta: 30.0 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 56608.96 ms. Allocated memory was 138.4 MB in the beginning and 207.6 MB in the end (delta: 69.2 MB). Free memory was 71.2 MB in the beginning and 123.6 MB in the end (delta: -52.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Witness Printer took 59.13 ms. Allocated memory is still 207.6 MB. Free memory was 123.6 MB in the beginning and 120.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1038]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = ((void*)0) VAL [head={-1:0}] [L999] head->prev = ((void*)0) VAL [head={-1:0}] [L1000] head->data = 0 VAL [head={-1:0}] [L1002] SLL* x = head; [L1003] int marked = 0; VAL [head={-1:0}, marked=0, x={-1:0}] [L1006] COND TRUE __VERIFIER_nondet_int() || !marked [L1009] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}] [L1010] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1010] x->next->prev = x VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1011] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1011] x = x->next [L1012] x->next = ((void*)0) VAL [head={-1:0}, marked=0, x={-2:0}] [L1014] COND TRUE __VERIFIER_nondet_int() [L1016] marked = 1 VAL [head={-1:0}, marked=1, x={-2:0}] [L1019] COND TRUE \read(marked) VAL [head={-1:0}, marked=1, x={-2:0}] [L1020] x->data = 1 VAL [head={-1:0}, marked=1, x={-2:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1025] x = head VAL [head={-1:0}, marked=1, x={-1:0}] [L1027] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, marked=1, x={-1:0}] [L1028] marked = 0 VAL [head={-1:0}, marked=0, x={-1:0}] [L1030] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1030] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1] [L1030] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1] [L1030] EXPR x->next->data VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1, x->next->data=1] [L1030] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=0, x->next->data=1] [L1030] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1035] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1035] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1035] x->next != ((void*)0) && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-3, head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && __VERIFIER_nondet_int()=1] [L1035] COND TRUE x->next != ((void*)0) && __VERIFIER_nondet_int() [L1037] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1037] x = x->next [L1038] EXPR x->data VAL [head={-1:0}, marked=0, x={-2:0}, x->data=1] [L1038] COND TRUE !(x->data != 1) [L1038] reach_error() VAL [head={-1:0}, marked=0, x={-2:0}] - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1069]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1069]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1069]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1070]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1071]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1071]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1078]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1078]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1079]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1079]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1079]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 56471.3ms, OverallIterations: 21, TraceHistogramMax: 2, EmptinessCheckTime: 49.0ms, AutomataDifference: 40061.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 20.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2304 SDtfs, 7038 SDslu, 7930 SDs, 0 SdLazy, 14445 SolverSat, 799 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 21072.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 527 GetRequests, 189 SyntacticMatches, 8 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3031 ImplicationChecksByTransitivity, 21581.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=15, InterpolantAutomatonStates: 238, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 281.1ms AutomataMinimizationTime, 20 MinimizatonAttempts, 986 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 126.0ms SsaConstructionTime, 577.6ms SatisfiabilityAnalysisTime, 12672.2ms InterpolantComputationTime, 802 NumberOfCodeBlocks, 802 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 731 ConstructedInterpolants, 43 QuantifiedInterpolants, 8977 SizeOfPredicates, 68 NumberOfNonLiveVariables, 1097 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 19/45 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-21 19:21:05,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5465d4d5-c71a-422c-aaa1-296f4ab84ab5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...