./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 22:07:51,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:07:51,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:07:51,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:07:51,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:07:52,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:07:52,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:07:52,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:07:52,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:07:52,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:07:52,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:07:52,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:07:52,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:07:52,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:07:52,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:07:52,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:07:52,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:07:52,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:07:52,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:07:52,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:07:52,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:07:52,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:07:52,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:07:52,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:07:52,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:07:52,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:07:52,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:07:52,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:07:52,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:07:52,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:07:52,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:07:52,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:07:52,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:07:52,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:07:52,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:07:52,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:07:52,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:07:52,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:07:52,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:07:52,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:07:52,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:07:52,081 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-02 22:07:52,134 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:07:52,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:07:52,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:07:52,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:07:52,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:07:52,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:07:52,137 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:07:52,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:07:52,137 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:07:52,137 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-02 22:07:52,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 22:07:52,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:07:52,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:07:52,138 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-02 22:07:52,139 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-02 22:07:52,139 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-02 22:07:52,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 22:07:52,139 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-02 22:07:52,140 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:07:52,140 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:07:52,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:07:52,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:07:52,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 22:07:52,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:07:52,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:07:52,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 22:07:52,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 22:07:52,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 22:07:52,142 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:07:52,142 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_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/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_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 [2021-11-02 22:07:52,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:07:52,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:07:52,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:07:52,432 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:07:52,434 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:07:52,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2021-11-02 22:07:52,526 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/data/7e5015f17/c7fdeb2714d74f0399b5599a4e833de8/FLAG3fa031a29 [2021-11-02 22:07:53,138 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:07:53,139 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2021-11-02 22:07:53,154 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/data/7e5015f17/c7fdeb2714d74f0399b5599a4e833de8/FLAG3fa031a29 [2021-11-02 22:07:53,366 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/data/7e5015f17/c7fdeb2714d74f0399b5599a4e833de8 [2021-11-02 22:07:53,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:07:53,371 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-02 22:07:53,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:07:53,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:07:53,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:07:53,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:07:53" (1/1) ... [2021-11-02 22:07:53,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158ac790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:53, skipping insertion in model container [2021-11-02 22:07:53,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:07:53" (1/1) ... [2021-11-02 22:07:53,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:07:53,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:07:53,881 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2021-11-02 22:07:53,891 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2021-11-02 22:07:53,893 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2021-11-02 22:07:53,894 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2021-11-02 22:07:53,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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2021-11-02 22:07:53,898 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2021-11-02 22:07:53,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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2021-11-02 22:07:53,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:07:53,932 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:07:53,979 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2021-11-02 22:07:53,980 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2021-11-02 22:07:53,981 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2021-11-02 22:07:53,983 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2021-11-02 22:07:53,984 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2021-11-02 22:07:53,985 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2021-11-02 22:07:53,986 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2021-11-02 22:07:53,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:07:54,026 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:07:54,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:54 WrapperNode [2021-11-02 22:07:54,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:07:54,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:07:54,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:07:54,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:07:54,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:54" (1/1) ... [2021-11-02 22:07:54,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:54" (1/1) ... [2021-11-02 22:07:54,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:54" (1/1) ... [2021-11-02 22:07:54,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:54" (1/1) ... [2021-11-02 22:07:54,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:54" (1/1) ... [2021-11-02 22:07:54,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:54" (1/1) ... [2021-11-02 22:07:54,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:54" (1/1) ... [2021-11-02 22:07:54,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:07:54,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:07:54,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:07:54,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:07:54,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:54" (1/1) ... [2021-11-02 22:07:54,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:07:54,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:07:54,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 22:07:54,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 22:07:54,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-11-02 22:07:54,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:07:54,228 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-11-02 22:07:54,228 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-11-02 22:07:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-11-02 22:07:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-11-02 22:07:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-11-02 22:07:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-11-02 22:07:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-11-02 22:07:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-11-02 22:07:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-11-02 22:07:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-11-02 22:07:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-11-02 22:07:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-11-02 22:07:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-11-02 22:07:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-11-02 22:07:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-11-02 22:07:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-11-02 22:07:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-11-02 22:07:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-11-02 22:07:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-11-02 22:07:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-11-02 22:07:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-11-02 22:07:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-11-02 22:07:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-11-02 22:07:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-11-02 22:07:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-11-02 22:07:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-11-02 22:07:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-11-02 22:07:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-11-02 22:07:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-11-02 22:07:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-11-02 22:07:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-11-02 22:07:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-11-02 22:07:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-11-02 22:07:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-11-02 22:07:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-11-02 22:07:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-11-02 22:07:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-11-02 22:07:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-11-02 22:07:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-11-02 22:07:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-11-02 22:07:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-11-02 22:07:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-11-02 22:07:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-11-02 22:07:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-11-02 22:07:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-11-02 22:07:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-11-02 22:07:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-11-02 22:07:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-11-02 22:07:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-11-02 22:07:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-11-02 22:07:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-11-02 22:07:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-11-02 22:07:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-11-02 22:07:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-11-02 22:07:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-11-02 22:07:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-11-02 22:07:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-11-02 22:07:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-11-02 22:07:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-11-02 22:07:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-11-02 22:07:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-11-02 22:07:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-11-02 22:07:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-11-02 22:07:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-11-02 22:07:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-11-02 22:07:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-11-02 22:07:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-11-02 22:07:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-11-02 22:07:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-11-02 22:07:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-11-02 22:07:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-11-02 22:07:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-11-02 22:07:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-11-02 22:07:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-11-02 22:07:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-11-02 22:07:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-11-02 22:07:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-11-02 22:07:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-11-02 22:07:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-11-02 22:07:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-11-02 22:07:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-11-02 22:07:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-11-02 22:07:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-11-02 22:07:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-11-02 22:07:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-11-02 22:07:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-11-02 22:07:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-11-02 22:07:54,245 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-11-02 22:07:54,245 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-11-02 22:07:54,245 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-11-02 22:07:54,245 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-11-02 22:07:54,245 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-11-02 22:07:54,246 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-11-02 22:07:54,246 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-11-02 22:07:54,246 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-11-02 22:07:54,246 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-11-02 22:07:54,246 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-11-02 22:07:54,246 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-11-02 22:07:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-11-02 22:07:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-11-02 22:07:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-11-02 22:07:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-11-02 22:07:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-11-02 22:07:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-11-02 22:07:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-11-02 22:07:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-11-02 22:07:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-11-02 22:07:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-11-02 22:07:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-11-02 22:07:54,249 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-11-02 22:07:54,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:07:54,249 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-11-02 22:07:54,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 22:07:54,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 22:07:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 22:07:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 22:07:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 22:07:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 22:07:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-11-02 22:07:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 22:07:54,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:07:55,168 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:07:55,169 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-11-02 22:07:55,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:07:55 BoogieIcfgContainer [2021-11-02 22:07:55,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:07:55,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 22:07:55,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 22:07:55,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 22:07:55,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 10:07:53" (1/3) ... [2021-11-02 22:07:55,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f1d606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:07:55, skipping insertion in model container [2021-11-02 22:07:55,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:54" (2/3) ... [2021-11-02 22:07:55,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f1d606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:07:55, skipping insertion in model container [2021-11-02 22:07:55,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:07:55" (3/3) ... [2021-11-02 22:07:55,188 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2021-11-02 22:07:55,203 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 22:07:55,203 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2021-11-02 22:07:55,258 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 22:07:55,265 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-11-02 22:07:55,265 INFO L340 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2021-11-02 22:07:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 89 states have (on average 2.202247191011236) internal successors, (196), 166 states have internal predecessors, (196), 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-11-02 22:07:55,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-02 22:07:55,296 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:07:55,297 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:55,298 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:07:55,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:55,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1463572285, now seen corresponding path program 1 times [2021-11-02 22:07:55,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:55,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124764244] [2021-11-02 22:07:55,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:55,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:55,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:07:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:55,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:55,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124764244] [2021-11-02 22:07:55,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124764244] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:55,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:55,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:07:55,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736168189] [2021-11-02 22:07:55,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:07:55,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:55,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:07:55,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:07:55,630 INFO L87 Difference]: Start difference. First operand has 171 states, 89 states have (on average 2.202247191011236) internal successors, (196), 166 states have internal predecessors, (196), 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-11-02 22:07:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:07:56,040 INFO L93 Difference]: Finished difference Result 197 states and 204 transitions. [2021-11-02 22:07:56,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:07:56,042 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-11-02 22:07:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:07:56,058 INFO L225 Difference]: With dead ends: 197 [2021-11-02 22:07:56,058 INFO L226 Difference]: Without dead ends: 193 [2021-11-02 22:07:56,060 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:07:56,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-02 22:07:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2021-11-02 22:07:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 88 states have (on average 1.8977272727272727) internal successors, (167), 161 states have internal predecessors, (167), 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-11-02 22:07:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 170 transitions. [2021-11-02 22:07:56,144 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 170 transitions. Word has length 7 [2021-11-02 22:07:56,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:07:56,144 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 170 transitions. [2021-11-02 22:07:56,145 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-11-02 22:07:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 170 transitions. [2021-11-02 22:07:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-02 22:07:56,145 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:07:56,145 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:56,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 22:07:56,146 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:07:56,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:56,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1463572286, now seen corresponding path program 1 times [2021-11-02 22:07:56,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:56,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805680139] [2021-11-02 22:07:56,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:56,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:07:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:56,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:56,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805680139] [2021-11-02 22:07:56,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805680139] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:56,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:56,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:07:56,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291105226] [2021-11-02 22:07:56,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:07:56,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:56,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:07:56,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:07:56,349 INFO L87 Difference]: Start difference. First operand 165 states and 170 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-11-02 22:07:56,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:07:56,768 INFO L93 Difference]: Finished difference Result 162 states and 167 transitions. [2021-11-02 22:07:56,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:07:56,769 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-11-02 22:07:56,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:07:56,775 INFO L225 Difference]: With dead ends: 162 [2021-11-02 22:07:56,775 INFO L226 Difference]: Without dead ends: 162 [2021-11-02 22:07:56,776 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:07:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-02 22:07:56,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-11-02 22:07:56,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 88 states have (on average 1.8636363636363635) internal successors, (164), 158 states have internal predecessors, (164), 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-11-02 22:07:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 167 transitions. [2021-11-02 22:07:56,799 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 167 transitions. Word has length 7 [2021-11-02 22:07:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:07:56,800 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 167 transitions. [2021-11-02 22:07:56,800 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-11-02 22:07:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 167 transitions. [2021-11-02 22:07:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 22:07:56,801 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:07:56,801 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:56,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 22:07:56,802 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr6REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:07:56,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:56,803 INFO L85 PathProgramCache]: Analyzing trace with hash 646742145, now seen corresponding path program 1 times [2021-11-02 22:07:56,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:56,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156607482] [2021-11-02 22:07:56,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:56,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:56,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:07:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:56,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:56,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156607482] [2021-11-02 22:07:56,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156607482] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:56,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:56,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:07:56,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384195540] [2021-11-02 22:07:56,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:07:56,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:56,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:07:56,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:07:56,977 INFO L87 Difference]: Start difference. First operand 162 states and 167 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11-02 22:07:57,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:07:57,232 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2021-11-02 22:07:57,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:07:57,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 11 [2021-11-02 22:07:57,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:07:57,234 INFO L225 Difference]: With dead ends: 161 [2021-11-02 22:07:57,234 INFO L226 Difference]: Without dead ends: 161 [2021-11-02 22:07:57,235 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:07:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-02 22:07:57,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2021-11-02 22:07:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 90 states have (on average 1.788888888888889) internal successors, (161), 153 states have internal predecessors, (161), 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-11-02 22:07:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 164 transitions. [2021-11-02 22:07:57,243 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 164 transitions. Word has length 11 [2021-11-02 22:07:57,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:07:57,244 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 164 transitions. [2021-11-02 22:07:57,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11-02 22:07:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2021-11-02 22:07:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 22:07:57,245 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:07:57,245 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:57,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 22:07:57,245 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr7REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:07:57,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:57,246 INFO L85 PathProgramCache]: Analyzing trace with hash 646742146, now seen corresponding path program 1 times [2021-11-02 22:07:57,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:57,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345918884] [2021-11-02 22:07:57,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:57,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:57,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:07:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:57,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:57,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:57,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345918884] [2021-11-02 22:07:57,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345918884] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:57,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:57,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:07:57,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556806731] [2021-11-02 22:07:57,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:07:57,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:57,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:07:57,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:07:57,342 INFO L87 Difference]: Start difference. First operand 157 states and 164 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11-02 22:07:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:07:57,643 INFO L93 Difference]: Finished difference Result 174 states and 180 transitions. [2021-11-02 22:07:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:07:57,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 11 [2021-11-02 22:07:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:07:57,649 INFO L225 Difference]: With dead ends: 174 [2021-11-02 22:07:57,649 INFO L226 Difference]: Without dead ends: 174 [2021-11-02 22:07:57,649 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:07:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-11-02 22:07:57,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2021-11-02 22:07:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 97 states have (on average 1.7010309278350515) internal successors, (165), 157 states have internal predecessors, (165), 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-11-02 22:07:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 168 transitions. [2021-11-02 22:07:57,656 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 168 transitions. Word has length 11 [2021-11-02 22:07:57,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:07:57,656 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 168 transitions. [2021-11-02 22:07:57,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11-02 22:07:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 168 transitions. [2021-11-02 22:07:57,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-02 22:07:57,658 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:07:57,658 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:57,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 22:07:57,658 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr12REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:07:57,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:57,659 INFO L85 PathProgramCache]: Analyzing trace with hash -955929302, now seen corresponding path program 1 times [2021-11-02 22:07:57,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:57,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454188688] [2021-11-02 22:07:57,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:57,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:57,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:07:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:57,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:57,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454188688] [2021-11-02 22:07:57,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454188688] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:57,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:57,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:07:57,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034346163] [2021-11-02 22:07:57,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:07:57,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:57,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:07:57,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:07:57,741 INFO L87 Difference]: Start difference. First operand 161 states and 168 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-11-02 22:07:58,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:07:58,045 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2021-11-02 22:07:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 22:07:58,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 17 [2021-11-02 22:07:58,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:07:58,047 INFO L225 Difference]: With dead ends: 162 [2021-11-02 22:07:58,047 INFO L226 Difference]: Without dead ends: 162 [2021-11-02 22:07:58,047 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:07:58,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-02 22:07:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 148. [2021-11-02 22:07:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 144 states have internal predecessors, (154), 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-11-02 22:07:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2021-11-02 22:07:58,052 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 17 [2021-11-02 22:07:58,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:07:58,052 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2021-11-02 22:07:58,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-11-02 22:07:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2021-11-02 22:07:58,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-02 22:07:58,054 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:07:58,054 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:58,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 22:07:58,054 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:07:58,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:58,055 INFO L85 PathProgramCache]: Analyzing trace with hash -955929301, now seen corresponding path program 1 times [2021-11-02 22:07:58,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:58,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059068778] [2021-11-02 22:07:58,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:58,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:58,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:07:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:58,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:58,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059068778] [2021-11-02 22:07:58,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059068778] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:58,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:58,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:07:58,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225451432] [2021-11-02 22:07:58,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:07:58,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:07:58,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:07:58,195 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-11-02 22:07:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:07:58,611 INFO L93 Difference]: Finished difference Result 187 states and 197 transitions. [2021-11-02 22:07:58,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:07:58,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 17 [2021-11-02 22:07:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:07:58,614 INFO L225 Difference]: With dead ends: 187 [2021-11-02 22:07:58,614 INFO L226 Difference]: Without dead ends: 187 [2021-11-02 22:07:58,614 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:07:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-11-02 22:07:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 158. [2021-11-02 22:07:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 110 states have (on average 1.518181818181818) internal successors, (167), 154 states have internal predecessors, (167), 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-11-02 22:07:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2021-11-02 22:07:58,620 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 17 [2021-11-02 22:07:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:07:58,620 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2021-11-02 22:07:58,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-11-02 22:07:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2021-11-02 22:07:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-02 22:07:58,621 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:07:58,621 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:58,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 22:07:58,622 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr45ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:07:58,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:58,622 INFO L85 PathProgramCache]: Analyzing trace with hash 474995261, now seen corresponding path program 1 times [2021-11-02 22:07:58,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:58,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175294368] [2021-11-02 22:07:58,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:58,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:58,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:07:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:58,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:58,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175294368] [2021-11-02 22:07:58,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175294368] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:58,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:58,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 22:07:58,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231433922] [2021-11-02 22:07:58,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:07:58,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:58,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:07:58,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:07:58,751 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-11-02 22:07:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:07:59,086 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2021-11-02 22:07:59,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 22:07:59,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 19 [2021-11-02 22:07:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:07:59,089 INFO L225 Difference]: With dead ends: 201 [2021-11-02 22:07:59,090 INFO L226 Difference]: Without dead ends: 201 [2021-11-02 22:07:59,090 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:07:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-11-02 22:07:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 156. [2021-11-02 22:07:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 152 states have internal predecessors, (163), 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-11-02 22:07:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2021-11-02 22:07:59,098 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 19 [2021-11-02 22:07:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:07:59,098 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2021-11-02 22:07:59,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-11-02 22:07:59,099 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2021-11-02 22:07:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-02 22:07:59,100 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:07:59,100 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:59,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 22:07:59,100 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:07:59,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:59,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1838316838, now seen corresponding path program 1 times [2021-11-02 22:07:59,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:59,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72494959] [2021-11-02 22:07:59,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:59,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:59,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:07:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:59,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:59,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72494959] [2021-11-02 22:07:59,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72494959] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:59,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:59,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:07:59,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665074323] [2021-11-02 22:07:59,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:07:59,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:59,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:07:59,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:07:59,188 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-11-02 22:07:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:07:59,492 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2021-11-02 22:07:59,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 22:07:59,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-11-02 22:07:59,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:07:59,494 INFO L225 Difference]: With dead ends: 155 [2021-11-02 22:07:59,494 INFO L226 Difference]: Without dead ends: 155 [2021-11-02 22:07:59,494 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:07:59,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-02 22:07:59,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-11-02 22:07:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 151 states have internal predecessors, (161), 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-11-02 22:07:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 164 transitions. [2021-11-02 22:07:59,500 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 164 transitions. Word has length 20 [2021-11-02 22:07:59,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:07:59,500 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 164 transitions. [2021-11-02 22:07:59,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-11-02 22:07:59,501 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 164 transitions. [2021-11-02 22:07:59,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-02 22:07:59,501 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:07:59,502 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:59,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 22:07:59,502 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr17REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:07:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:59,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1838316839, now seen corresponding path program 1 times [2021-11-02 22:07:59,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:59,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696079567] [2021-11-02 22:07:59,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:59,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:07:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:59,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:59,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696079567] [2021-11-02 22:07:59,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696079567] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:59,641 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:59,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:07:59,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091669420] [2021-11-02 22:07:59,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:07:59,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:59,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:07:59,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:07:59,647 INFO L87 Difference]: Start difference. First operand 155 states and 164 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-11-02 22:07:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:07:59,956 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2021-11-02 22:07:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 22:07:59,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-11-02 22:07:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:07:59,957 INFO L225 Difference]: With dead ends: 154 [2021-11-02 22:07:59,957 INFO L226 Difference]: Without dead ends: 154 [2021-11-02 22:07:59,957 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:07:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-11-02 22:07:59,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-11-02 22:07:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 150 states have internal predecessors, (159), 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-11-02 22:07:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2021-11-02 22:07:59,961 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 20 [2021-11-02 22:07:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:07:59,962 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2021-11-02 22:07:59,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-11-02 22:07:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2021-11-02 22:07:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-02 22:07:59,963 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:07:59,963 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:59,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 22:07:59,963 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr48ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:07:59,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:59,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1329344305, now seen corresponding path program 1 times [2021-11-02 22:07:59,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:59,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602708634] [2021-11-02 22:07:59,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:59,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:00,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:00,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:00,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602708634] [2021-11-02 22:08:00,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602708634] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:00,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:00,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 22:08:00,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348426744] [2021-11-02 22:08:00,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 22:08:00,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:00,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:08:00,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:08:00,143 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-11-02 22:08:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:00,560 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2021-11-02 22:08:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 22:08:00,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 22 [2021-11-02 22:08:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:00,562 INFO L225 Difference]: With dead ends: 208 [2021-11-02 22:08:00,562 INFO L226 Difference]: Without dead ends: 208 [2021-11-02 22:08:00,562 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-02 22:08:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-02 22:08:00,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 159. [2021-11-02 22:08:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 114 states have (on average 1.4385964912280702) internal successors, (164), 155 states have internal predecessors, (164), 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-11-02 22:08:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2021-11-02 22:08:00,567 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 22 [2021-11-02 22:08:00,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:00,567 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2021-11-02 22:08:00,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-11-02 22:08:00,568 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2021-11-02 22:08:00,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 22:08:00,568 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:00,568 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:08:00,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 22:08:00,569 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:00,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:00,569 INFO L85 PathProgramCache]: Analyzing trace with hash 942465896, now seen corresponding path program 1 times [2021-11-02 22:08:00,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:00,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107508555] [2021-11-02 22:08:00,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:00,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:00,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:00,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:00,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107508555] [2021-11-02 22:08:00,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107508555] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:00,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:00,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 22:08:00,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487355883] [2021-11-02 22:08:00,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:00,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:00,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:00,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:00,710 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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-11-02 22:08:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:01,132 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2021-11-02 22:08:01,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 22:08:01,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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 24 [2021-11-02 22:08:01,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:01,134 INFO L225 Difference]: With dead ends: 158 [2021-11-02 22:08:01,134 INFO L226 Difference]: Without dead ends: 158 [2021-11-02 22:08:01,134 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-11-02 22:08:01,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-11-02 22:08:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2021-11-02 22:08:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 154 states have internal predecessors, (163), 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-11-02 22:08:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2021-11-02 22:08:01,139 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 24 [2021-11-02 22:08:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:01,140 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2021-11-02 22:08:01,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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-11-02 22:08:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2021-11-02 22:08:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 22:08:01,141 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:01,141 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:08:01,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 22:08:01,141 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:01,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash 942465897, now seen corresponding path program 1 times [2021-11-02 22:08:01,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:01,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786934790] [2021-11-02 22:08:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:01,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:01,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:01,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:01,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786934790] [2021-11-02 22:08:01,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786934790] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:01,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:01,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:01,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143344156] [2021-11-02 22:08:01,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 22:08:01,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:01,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 22:08:01,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-02 22:08:01,305 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-11-02 22:08:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:02,017 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2021-11-02 22:08:02,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 22:08:02,017 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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 24 [2021-11-02 22:08:02,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:02,018 INFO L225 Difference]: With dead ends: 176 [2021-11-02 22:08:02,018 INFO L226 Difference]: Without dead ends: 176 [2021-11-02 22:08:02,019 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-11-02 22:08:02,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-11-02 22:08:02,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2021-11-02 22:08:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 158 states have internal predecessors, (171), 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-11-02 22:08:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2021-11-02 22:08:02,025 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 24 [2021-11-02 22:08:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:02,026 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2021-11-02 22:08:02,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-11-02 22:08:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2021-11-02 22:08:02,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-02 22:08:02,031 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:02,032 INFO L513 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-11-02 22:08:02,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 22:08:02,032 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:02,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:02,033 INFO L85 PathProgramCache]: Analyzing trace with hash 470516267, now seen corresponding path program 1 times [2021-11-02 22:08:02,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:02,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258291110] [2021-11-02 22:08:02,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:02,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:02,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:02,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:02,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258291110] [2021-11-02 22:08:02,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258291110] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:08:02,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510631620] [2021-11-02 22:08:02,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:02,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:08:02,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:08:02,156 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:08:02,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-02 22:08:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:02,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-02 22:08:02,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:02,427 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-11-02 22:08:02,501 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-02 22:08:02,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-02 22:08:02,542 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-11-02 22:08:02,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:08:02,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-02 22:08:02,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:08:02,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:08:02,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:08:02,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-02 22:08:02,943 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 22:08:02,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 21 [2021-11-02 22:08:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:03,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510631620] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:08:03,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:08:03,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2021-11-02 22:08:03,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513835177] [2021-11-02 22:08:03,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-02 22:08:03,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:03,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-02 22:08:03,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-02 22:08:03,065 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 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-11-02 22:08:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:04,365 INFO L93 Difference]: Finished difference Result 226 states and 242 transitions. [2021-11-02 22:08:04,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-02 22:08:04,365 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 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 29 [2021-11-02 22:08:04,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:04,367 INFO L225 Difference]: With dead ends: 226 [2021-11-02 22:08:04,367 INFO L226 Difference]: Without dead ends: 226 [2021-11-02 22:08:04,368 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2021-11-02 22:08:04,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-02 22:08:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 169. [2021-11-02 22:08:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 131 states have (on average 1.366412213740458) internal successors, (179), 165 states have internal predecessors, (179), 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-11-02 22:08:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 182 transitions. [2021-11-02 22:08:04,373 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 182 transitions. Word has length 29 [2021-11-02 22:08:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:04,374 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 182 transitions. [2021-11-02 22:08:04,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 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-11-02 22:08:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 182 transitions. [2021-11-02 22:08:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-02 22:08:04,375 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:04,375 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:08:04,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-02 22:08:04,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:08:04,587 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr53ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:04,588 INFO L85 PathProgramCache]: Analyzing trace with hash 428498014, now seen corresponding path program 1 times [2021-11-02 22:08:04,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:04,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128288979] [2021-11-02 22:08:04,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:04,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:04,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:04,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128288979] [2021-11-02 22:08:04,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128288979] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:04,703 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:04,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 22:08:04,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211250280] [2021-11-02 22:08:04,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:08:04,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:04,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:08:04,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:08:04,707 INFO L87 Difference]: Start difference. First operand 169 states and 182 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-11-02 22:08:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:04,966 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2021-11-02 22:08:04,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 22:08:04,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-11-02 22:08:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:04,968 INFO L225 Difference]: With dead ends: 173 [2021-11-02 22:08:04,968 INFO L226 Difference]: Without dead ends: 173 [2021-11-02 22:08:04,969 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:08:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-11-02 22:08:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2021-11-02 22:08:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 130 states have (on average 1.353846153846154) internal successors, (176), 164 states have internal predecessors, (176), 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-11-02 22:08:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2021-11-02 22:08:04,974 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 29 [2021-11-02 22:08:04,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:04,974 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2021-11-02 22:08:04,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-11-02 22:08:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2021-11-02 22:08:04,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-02 22:08:04,977 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:04,977 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:08:04,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 22:08:04,977 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr40ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:04,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1019922444, now seen corresponding path program 1 times [2021-11-02 22:08:04,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:04,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71400447] [2021-11-02 22:08:04,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:04,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:05,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:05,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:05,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71400447] [2021-11-02 22:08:05,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71400447] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:05,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:05,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:08:05,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387539973] [2021-11-02 22:08:05,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:08:05,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:05,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:08:05,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:08:05,073 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-11-02 22:08:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:05,281 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2021-11-02 22:08:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:08:05,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 30 [2021-11-02 22:08:05,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:05,282 INFO L225 Difference]: With dead ends: 170 [2021-11-02 22:08:05,282 INFO L226 Difference]: Without dead ends: 170 [2021-11-02 22:08:05,283 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:08:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-11-02 22:08:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2021-11-02 22:08:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.3410852713178294) internal successors, (173), 162 states have internal predecessors, (173), 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-11-02 22:08:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 176 transitions. [2021-11-02 22:08:05,289 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 176 transitions. Word has length 30 [2021-11-02 22:08:05,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:05,290 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 176 transitions. [2021-11-02 22:08:05,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-11-02 22:08:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2021-11-02 22:08:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-02 22:08:05,293 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:05,293 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:08:05,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 22:08:05,293 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr31REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:05,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:05,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1154646554, now seen corresponding path program 1 times [2021-11-02 22:08:05,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:05,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416969757] [2021-11-02 22:08:05,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:05,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:05,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:05,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:05,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416969757] [2021-11-02 22:08:05,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416969757] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:05,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:05,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:08:05,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800993256] [2021-11-02 22:08:05,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:08:05,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:05,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:08:05,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:08:05,395 INFO L87 Difference]: Start difference. First operand 166 states and 176 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-11-02 22:08:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:05,642 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2021-11-02 22:08:05,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 22:08:05,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 32 [2021-11-02 22:08:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:05,644 INFO L225 Difference]: With dead ends: 165 [2021-11-02 22:08:05,644 INFO L226 Difference]: Without dead ends: 165 [2021-11-02 22:08:05,644 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:08:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-11-02 22:08:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-11-02 22:08:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 129 states have (on average 1.3333333333333333) internal successors, (172), 161 states have internal predecessors, (172), 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-11-02 22:08:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2021-11-02 22:08:05,649 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 32 [2021-11-02 22:08:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:05,649 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2021-11-02 22:08:05,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-11-02 22:08:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2021-11-02 22:08:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-02 22:08:05,650 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:05,651 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:08:05,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 22:08:05,651 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr30REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:05,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:05,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1154646553, now seen corresponding path program 1 times [2021-11-02 22:08:05,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:05,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169718538] [2021-11-02 22:08:05,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:05,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:05,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:05,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:05,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169718538] [2021-11-02 22:08:05,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169718538] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:05,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:05,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:08:05,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775011907] [2021-11-02 22:08:05,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:08:05,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:05,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:08:05,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:08:05,720 INFO L87 Difference]: Start difference. First operand 165 states and 175 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-11-02 22:08:05,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:05,934 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2021-11-02 22:08:05,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 22:08:05,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 32 [2021-11-02 22:08:05,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:05,936 INFO L225 Difference]: With dead ends: 164 [2021-11-02 22:08:05,936 INFO L226 Difference]: Without dead ends: 164 [2021-11-02 22:08:05,936 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:08:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-02 22:08:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-11-02 22:08:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.3255813953488371) internal successors, (171), 160 states have internal predecessors, (171), 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-11-02 22:08:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2021-11-02 22:08:05,941 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 32 [2021-11-02 22:08:05,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:05,941 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2021-11-02 22:08:05,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-11-02 22:08:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2021-11-02 22:08:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-02 22:08:05,942 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:05,942 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:08:05,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 22:08:05,942 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr43ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:05,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1914894277, now seen corresponding path program 1 times [2021-11-02 22:08:05,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:05,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404046024] [2021-11-02 22:08:05,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:05,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:06,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:06,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:06,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404046024] [2021-11-02 22:08:06,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404046024] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:06,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:06,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:08:06,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874394453] [2021-11-02 22:08:06,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:08:06,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:06,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:08:06,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:08:06,024 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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-11-02 22:08:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:06,232 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2021-11-02 22:08:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:08:06,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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 33 [2021-11-02 22:08:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:06,234 INFO L225 Difference]: With dead ends: 163 [2021-11-02 22:08:06,234 INFO L226 Difference]: Without dead ends: 163 [2021-11-02 22:08:06,234 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:08:06,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-02 22:08:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2021-11-02 22:08:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 128 states have (on average 1.3125) internal successors, (168), 158 states have internal predecessors, (168), 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-11-02 22:08:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2021-11-02 22:08:06,239 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 33 [2021-11-02 22:08:06,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:06,239 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2021-11-02 22:08:06,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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-11-02 22:08:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2021-11-02 22:08:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-02 22:08:06,240 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:06,240 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:08:06,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-02 22:08:06,241 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr74ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:06,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1259434580, now seen corresponding path program 1 times [2021-11-02 22:08:06,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:06,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49778527] [2021-11-02 22:08:06,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:06,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:06,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:08:06,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:06,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49778527] [2021-11-02 22:08:06,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49778527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:06,297 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:06,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:08:06,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016917520] [2021-11-02 22:08:06,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:08:06,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:06,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:08:06,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:08:06,299 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-02 22:08:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:06,453 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2021-11-02 22:08:06,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:08:06,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 35 [2021-11-02 22:08:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:06,455 INFO L225 Difference]: With dead ends: 164 [2021-11-02 22:08:06,455 INFO L226 Difference]: Without dead ends: 164 [2021-11-02 22:08:06,455 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:08:06,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-02 22:08:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-11-02 22:08:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 160 states have internal predecessors, (170), 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-11-02 22:08:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2021-11-02 22:08:06,459 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 35 [2021-11-02 22:08:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:06,460 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2021-11-02 22:08:06,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-02 22:08:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2021-11-02 22:08:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-02 22:08:06,461 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:06,461 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:08:06,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-02 22:08:06,462 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1967527785, now seen corresponding path program 1 times [2021-11-02 22:08:06,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:06,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174167951] [2021-11-02 22:08:06,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:06,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:06,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:06,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174167951] [2021-11-02 22:08:06,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174167951] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:06,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:06,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-02 22:08:06,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149944660] [2021-11-02 22:08:06,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 22:08:06,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:06,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 22:08:06,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-02 22:08:06,651 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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-11-02 22:08:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:07,267 INFO L93 Difference]: Finished difference Result 202 states and 211 transitions. [2021-11-02 22:08:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-02 22:08:07,268 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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 35 [2021-11-02 22:08:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:07,269 INFO L225 Difference]: With dead ends: 202 [2021-11-02 22:08:07,269 INFO L226 Difference]: Without dead ends: 202 [2021-11-02 22:08:07,270 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2021-11-02 22:08:07,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-02 22:08:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 164. [2021-11-02 22:08:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 130 states have (on average 1.3) internal successors, (169), 160 states have internal predecessors, (169), 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-11-02 22:08:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 172 transitions. [2021-11-02 22:08:07,275 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 172 transitions. Word has length 35 [2021-11-02 22:08:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:07,275 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 172 transitions. [2021-11-02 22:08:07,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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-11-02 22:08:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 172 transitions. [2021-11-02 22:08:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 22:08:07,276 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:07,276 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:08:07,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-02 22:08:07,277 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:07,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1254504805, now seen corresponding path program 1 times [2021-11-02 22:08:07,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:07,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147984847] [2021-11-02 22:08:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:07,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:07,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:07,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:07,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147984847] [2021-11-02 22:08:07,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147984847] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:07,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:07,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 22:08:07,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075436037] [2021-11-02 22:08:07,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 22:08:07,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:07,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:08:07,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:08:07,404 INFO L87 Difference]: Start difference. First operand 164 states and 172 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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-11-02 22:08:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:07,793 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2021-11-02 22:08:07,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 22:08:07,794 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 36 [2021-11-02 22:08:07,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:07,795 INFO L225 Difference]: With dead ends: 164 [2021-11-02 22:08:07,795 INFO L226 Difference]: Without dead ends: 164 [2021-11-02 22:08:07,795 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-11-02 22:08:07,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-02 22:08:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2021-11-02 22:08:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 130 states have (on average 1.2923076923076924) internal successors, (168), 159 states have internal predecessors, (168), 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-11-02 22:08:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2021-11-02 22:08:07,800 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 171 transitions. Word has length 36 [2021-11-02 22:08:07,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:07,800 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 171 transitions. [2021-11-02 22:08:07,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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-11-02 22:08:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2021-11-02 22:08:07,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 22:08:07,801 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:07,801 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:08:07,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-02 22:08:07,801 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:07,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:07,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1254504804, now seen corresponding path program 1 times [2021-11-02 22:08:07,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:07,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271918086] [2021-11-02 22:08:07,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:07,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:07,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:07,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:07,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271918086] [2021-11-02 22:08:07,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271918086] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:07,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:07,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 22:08:07,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134321021] [2021-11-02 22:08:07,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:07,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:07,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:07,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:07,964 INFO L87 Difference]: Start difference. First operand 163 states and 171 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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-11-02 22:08:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:08,436 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2021-11-02 22:08:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 22:08:08,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 36 [2021-11-02 22:08:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:08,437 INFO L225 Difference]: With dead ends: 159 [2021-11-02 22:08:08,438 INFO L226 Difference]: Without dead ends: 159 [2021-11-02 22:08:08,438 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-11-02 22:08:08,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-02 22:08:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2021-11-02 22:08:08,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 121 states have (on average 1.2479338842975207) internal successors, (151), 143 states have internal predecessors, (151), 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-11-02 22:08:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2021-11-02 22:08:08,442 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 36 [2021-11-02 22:08:08,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:08,443 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2021-11-02 22:08:08,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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-11-02 22:08:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2021-11-02 22:08:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-02 22:08:08,444 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:08,444 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:08:08,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-02 22:08:08,444 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr66REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:08,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2131891079, now seen corresponding path program 1 times [2021-11-02 22:08:08,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:08,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702307658] [2021-11-02 22:08:08,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:08,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:08,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:08,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:08,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702307658] [2021-11-02 22:08:08,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702307658] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:08:08,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186978326] [2021-11-02 22:08:08,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:08,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:08:08,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:08:08,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:08:08,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-02 22:08:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:08,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 22:08:08,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:08,742 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 13 treesize of output 9 [2021-11-02 22:08:08,797 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 19 treesize of output 7 [2021-11-02 22:08:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:08:08,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186978326] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:08,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 22:08:08,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2021-11-02 22:08:08,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741392329] [2021-11-02 22:08:08,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:08:08,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:08,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:08:08,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:08,824 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-11-02 22:08:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:08,891 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2021-11-02 22:08:08,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:08:08,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 37 [2021-11-02 22:08:08,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:08,892 INFO L225 Difference]: With dead ends: 156 [2021-11-02 22:08:08,892 INFO L226 Difference]: Without dead ends: 156 [2021-11-02 22:08:08,893 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-02 22:08:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-11-02 22:08:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2021-11-02 22:08:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 124 states have (on average 1.2419354838709677) internal successors, (154), 146 states have internal predecessors, (154), 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-11-02 22:08:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2021-11-02 22:08:08,897 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 37 [2021-11-02 22:08:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:08,897 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2021-11-02 22:08:08,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-11-02 22:08:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2021-11-02 22:08:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-02 22:08:08,898 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:08,898 INFO L513 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] [2021-11-02 22:08:08,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-02 22:08:09,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:08:09,111 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr59REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:09,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1019054532, now seen corresponding path program 1 times [2021-11-02 22:08:09,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:09,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013291646] [2021-11-02 22:08:09,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:09,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:09,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:08:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:09,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:09,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013291646] [2021-11-02 22:08:09,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013291646] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:08:09,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315041881] [2021-11-02 22:08:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:09,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:08:09,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:08:09,267 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:08:09,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-02 22:08:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:09,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-02 22:08:09,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:09,477 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-11-02 22:08:09,481 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-11-02 22:08:09,499 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 0 case distinctions, treesize of input 26 treesize of output 21 [2021-11-02 22:08:09,508 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-02 22:08:09,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2021-11-02 22:08:09,517 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 0 case distinctions, treesize of input 26 treesize of output 21 [2021-11-02 22:08:09,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:08:09,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:08:09,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2021-11-02 22:08:09,584 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-11-02 22:08:09,585 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 36 treesize of output 23 [2021-11-02 22:08:09,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:08:09,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:08:09,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:08:09,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-02 22:08:09,852 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-02 22:08:09,853 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-11-02 22:08:09,860 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-02 22:08:09,861 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-11-02 22:08:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:08:09,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315041881] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:08:09,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:08:09,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2021-11-02 22:08:09,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669654302] [2021-11-02 22:08:09,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 22:08:09,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:09,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:08:09,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:08:09,901 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 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-11-02 22:08:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:10,247 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2021-11-02 22:08:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 22:08:10,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 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 38 [2021-11-02 22:08:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:10,249 INFO L225 Difference]: With dead ends: 160 [2021-11-02 22:08:10,249 INFO L226 Difference]: Without dead ends: 160 [2021-11-02 22:08:10,249 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-11-02 22:08:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-11-02 22:08:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2021-11-02 22:08:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 130 states have (on average 1.2307692307692308) internal successors, (160), 152 states have internal predecessors, (160), 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-11-02 22:08:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 163 transitions. [2021-11-02 22:08:10,254 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 163 transitions. Word has length 38 [2021-11-02 22:08:10,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:10,254 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 163 transitions. [2021-11-02 22:08:10,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 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-11-02 22:08:10,254 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 163 transitions. [2021-11-02 22:08:10,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-02 22:08:10,255 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:10,255 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:08:10,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-02 22:08:10,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-02 22:08:10,479 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr76ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:10,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:10,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1525919079, now seen corresponding path program 1 times [2021-11-02 22:08:10,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:10,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238522334] [2021-11-02 22:08:10,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:10,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:08:10,495 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:08:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:08:10,535 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:08:10,535 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-02 22:08:10,536 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr76ENSURES_VIOLATIONMEMORY_LEAK [2021-11-02 22:08:10,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-11-02 22:08:10,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-11-02 22:08:10,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-11-02 22:08:10,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-11-02 22:08:10,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-11-02 22:08:10,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-11-02 22:08:10,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-11-02 22:08:10,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-11-02 22:08:10,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-11-02 22:08:10,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-11-02 22:08:10,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-11-02 22:08:10,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-11-02 22:08:10,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-11-02 22:08:10,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-11-02 22:08:10,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-11-02 22:08:10,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-11-02 22:08:10,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-11-02 22:08:10,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-11-02 22:08:10,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-11-02 22:08:10,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-11-02 22:08:10,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-11-02 22:08:10,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-11-02 22:08:10,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-11-02 22:08:10,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-11-02 22:08:10,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-11-02 22:08:10,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-11-02 22:08:10,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-11-02 22:08:10,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-11-02 22:08:10,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-11-02 22:08:10,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-11-02 22:08:10,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-11-02 22:08:10,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-11-02 22:08:10,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-11-02 22:08:10,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-11-02 22:08:10,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-11-02 22:08:10,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-11-02 22:08:10,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-11-02 22:08:10,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-11-02 22:08:10,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-11-02 22:08:10,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-11-02 22:08:10,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:08:10,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-11-02 22:08:10,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-11-02 22:08:10,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:08:10,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:08:10,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:08:10,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-11-02 22:08:10,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-11-02 22:08:10,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:08:10,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-11-02 22:08:10,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-11-02 22:08:10,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51REQUIRES_VIOLATION [2021-11-02 22:08:10,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-11-02 22:08:10,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:08:10,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION [2021-11-02 22:08:10,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-11-02 22:08:10,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:08:10,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57REQUIRES_VIOLATION [2021-11-02 22:08:10,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-11-02 22:08:10,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-11-02 22:08:10,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-11-02 22:08:10,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-11-02 22:08:10,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-11-02 22:08:10,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:08:10,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:08:10,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:08:10,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-11-02 22:08:10,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67REQUIRES_VIOLATION [2021-11-02 22:08:10,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:08:10,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:08:10,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:08:10,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71REQUIRES_VIOLATION [2021-11-02 22:08:10,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72REQUIRES_VIOLATION [2021-11-02 22:08:10,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:08:10,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:08:10,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:08:10,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-02 22:08:10,554 INFO L731 BasicCegarLoop]: Path program histogram: [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-11-02 22:08:10,557 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 22:08:10,588 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-11-02 22:08:10,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 10:08:10 BoogieIcfgContainer [2021-11-02 22:08:10,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 22:08:10,612 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 22:08:10,612 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 22:08:10,612 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 22:08:10,613 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:07:55" (3/4) ... [2021-11-02 22:08:10,616 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-02 22:08:10,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 22:08:10,617 INFO L168 Benchmark]: Toolchain (without parser) took 17245.90 ms. Allocated memory was 83.9 MB in the beginning and 172.0 MB in the end (delta: 88.1 MB). Free memory was 48.1 MB in the beginning and 98.6 MB in the end (delta: -50.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 16.1 GB. [2021-11-02 22:08:10,617 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 83.9 MB. Free memory was 56.0 MB in the beginning and 56.0 MB in the end (delta: 25.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:08:10,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 654.64 ms. Allocated memory was 83.9 MB in the beginning and 109.1 MB in the end (delta: 25.2 MB). Free memory was 47.9 MB in the beginning and 76.3 MB in the end (delta: -28.4 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. [2021-11-02 22:08:10,618 INFO L168 Benchmark]: Boogie Preprocessor took 95.70 ms. Allocated memory is still 109.1 MB. Free memory was 76.3 MB in the beginning and 73.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-02 22:08:10,618 INFO L168 Benchmark]: RCFGBuilder took 1048.57 ms. Allocated memory is still 109.1 MB. Free memory was 73.0 MB in the beginning and 70.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. [2021-11-02 22:08:10,619 INFO L168 Benchmark]: TraceAbstraction took 15433.53 ms. Allocated memory was 109.1 MB in the beginning and 172.0 MB in the end (delta: 62.9 MB). Free memory was 70.5 MB in the beginning and 98.6 MB in the end (delta: -28.1 MB). Peak memory consumption was 37.9 MB. Max. memory is 16.1 GB. [2021-11-02 22:08:10,619 INFO L168 Benchmark]: Witness Printer took 4.05 ms. Allocated memory is still 172.0 MB. Free memory is still 98.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:08:10,621 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.23 ms. Allocated memory is still 83.9 MB. Free memory was 56.0 MB in the beginning and 56.0 MB in the end (delta: 25.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 654.64 ms. Allocated memory was 83.9 MB in the beginning and 109.1 MB in the end (delta: 25.2 MB). Free memory was 47.9 MB in the beginning and 76.3 MB in the end (delta: -28.4 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 95.70 ms. Allocated memory is still 109.1 MB. Free memory was 76.3 MB in the beginning and 73.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1048.57 ms. Allocated memory is still 109.1 MB. Free memory was 73.0 MB in the beginning and 70.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15433.53 ms. Allocated memory was 109.1 MB in the beginning and 172.0 MB in the end (delta: 62.9 MB). Free memory was 70.5 MB in the beginning and 98.6 MB in the end (delta: -28.1 MB). Peak memory consumption was 37.9 MB. Max. memory is 16.1 GB. * Witness Printer took 4.05 ms. Allocated memory is still 172.0 MB. Free memory is still 98.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); [L999] null->next = ((void*)0) VAL [null={-1:0}] [L1000] null->prev = ((void*)0) VAL [null={-1:0}] [L1001] null->colour = BLACK VAL [null={-1:0}] [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null VAL [list={-2:0}, null={-1:0}] [L1005] list->prev = null VAL [list={-2:0}, null={-1:0}] [L1006] list->colour = BLACK VAL [list={-2:0}, null={-1:0}] [L1008] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1042] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, null={-1:0}] [L1042] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1045] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, null={-1:0}] [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next VAL [end={-2:0}, end->next={-1:0}, list={-2:0}, null={-1:0}] [L1052] end = end->next [L1043] COND FALSE !(null != end) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1056] COND TRUE null != list VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1058] EXPR list->colour VAL [end={-1:0}, list={-2:0}, list->colour=1, null={-1:0}] [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next VAL [end={-1:0}, list={-2:0}, list->next={-1:0}, null={-1:0}] [L1067] end = list->next [L1068] free(list) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1068] free(list) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1068] free(list) [L1069] list = end VAL [end={-1:0}, list={-1:0}, null={-1:0}] [L1056] COND FALSE !(null != list) VAL [end={-1:0}, list={-1:0}, null={-1:0}] [L1073] return 0; VAL [\result=0, end={-1:0}, list={-1:0}, null={-1:0}] - 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: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: 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: 1032]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1048]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: 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 free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free 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: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: 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 free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 174 locations, 77 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2292 SDtfs, 3018 SDslu, 4261 SDs, 0 SdLazy, 8684 SolverSat, 347 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=0, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 324 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 744 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 678 ConstructedInterpolants, 3 QuantifiedInterpolants, 5275 SizeOfPredicates, 16 NumberOfNonLiveVariables, 572 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 27 InterpolantComputations, 22 PerfectInterpolantSequences, 6/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-02 22:08:10,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 22:08:13,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:08:13,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:08:13,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:08:13,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:08:13,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:08:13,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:08:13,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:08:13,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:08:13,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:08:13,146 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:08:13,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:08:13,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:08:13,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:08:13,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:08:13,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:08:13,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:08:13,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:08:13,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:08:13,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:08:13,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:08:13,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:08:13,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:08:13,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:08:13,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:08:13,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:08:13,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:08:13,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:08:13,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:08:13,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:08:13,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:08:13,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:08:13,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:08:13,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:08:13,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:08:13,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:08:13,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:08:13,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:08:13,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:08:13,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:08:13,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:08:13,200 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-11-02 22:08:13,241 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:08:13,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:08:13,242 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:08:13,243 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:08:13,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:08:13,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:08:13,245 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:08:13,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:08:13,246 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:08:13,247 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-02 22:08:13,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 22:08:13,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:08:13,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:08:13,248 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-02 22:08:13,248 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-02 22:08:13,249 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-02 22:08:13,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 22:08:13,249 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-02 22:08:13,249 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-02 22:08:13,250 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-02 22:08:13,250 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:08:13,250 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:08:13,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:08:13,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:08:13,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 22:08:13,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:08:13,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:08:13,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 22:08:13,252 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-02 22:08:13,252 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-02 22:08:13,252 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:08:13,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-02 22:08:13,253 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/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_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 [2021-11-02 22:08:13,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:08:13,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:08:13,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:08:13,648 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:08:13,649 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:08:13,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2021-11-02 22:08:13,727 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/data/7af7e609e/625d63e1105c4b2282ca88296c0ba0fa/FLAG98f3c1011 [2021-11-02 22:08:14,324 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:08:14,325 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2021-11-02 22:08:14,337 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/data/7af7e609e/625d63e1105c4b2282ca88296c0ba0fa/FLAG98f3c1011 [2021-11-02 22:08:14,654 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/data/7af7e609e/625d63e1105c4b2282ca88296c0ba0fa [2021-11-02 22:08:14,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:08:14,662 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-02 22:08:14,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:08:14,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:08:14,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:08:14,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:08:14" (1/1) ... [2021-11-02 22:08:14,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d5f321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:14, skipping insertion in model container [2021-11-02 22:08:14,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:08:14" (1/1) ... [2021-11-02 22:08:14,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:08:14,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:08:15,111 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2021-11-02 22:08:15,115 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2021-11-02 22:08:15,116 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2021-11-02 22:08:15,119 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2021-11-02 22:08:15,125 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2021-11-02 22:08:15,130 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2021-11-02 22:08:15,132 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2021-11-02 22:08:15,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:08:15,168 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:08:15,222 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2021-11-02 22:08:15,223 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2021-11-02 22:08:15,224 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2021-11-02 22:08:15,225 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2021-11-02 22:08:15,225 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2021-11-02 22:08:15,227 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2021-11-02 22:08:15,227 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_f1c0c240-c842-4352-8fc7-73fae352598b/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2021-11-02 22:08:15,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:08:15,267 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:08:15,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:15 WrapperNode [2021-11-02 22:08:15,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:08:15,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:08:15,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:08:15,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:08:15,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:15" (1/1) ... [2021-11-02 22:08:15,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:15" (1/1) ... [2021-11-02 22:08:15,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:15" (1/1) ... [2021-11-02 22:08:15,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:15" (1/1) ... [2021-11-02 22:08:15,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:15" (1/1) ... [2021-11-02 22:08:15,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:15" (1/1) ... [2021-11-02 22:08:15,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:15" (1/1) ... [2021-11-02 22:08:15,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:08:15,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:08:15,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:08:15,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:08:15,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:15" (1/1) ... [2021-11-02 22:08:15,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:08:15,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:08:15,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 22:08:15,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 22:08:15,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-11-02 22:08:15,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:08:15,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-11-02 22:08:15,445 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-11-02 22:08:15,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-11-02 22:08:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-11-02 22:08:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-11-02 22:08:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-11-02 22:08:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-11-02 22:08:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-11-02 22:08:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-11-02 22:08:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-11-02 22:08:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-11-02 22:08:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-11-02 22:08:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-11-02 22:08:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-11-02 22:08:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-11-02 22:08:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-11-02 22:08:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-11-02 22:08:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-11-02 22:08:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-11-02 22:08:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-11-02 22:08:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-11-02 22:08:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-11-02 22:08:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-11-02 22:08:15,450 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-11-02 22:08:15,451 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-11-02 22:08:15,451 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-11-02 22:08:15,451 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-11-02 22:08:15,451 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-11-02 22:08:15,451 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-11-02 22:08:15,452 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-11-02 22:08:15,452 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-11-02 22:08:15,452 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-11-02 22:08:15,453 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-11-02 22:08:15,453 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-11-02 22:08:15,454 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-11-02 22:08:15,454 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-11-02 22:08:15,454 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-11-02 22:08:15,454 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-11-02 22:08:15,455 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-11-02 22:08:15,455 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-11-02 22:08:15,455 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-11-02 22:08:15,455 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-11-02 22:08:15,455 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-11-02 22:08:15,455 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-11-02 22:08:15,456 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-11-02 22:08:15,456 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-11-02 22:08:15,456 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-11-02 22:08:15,456 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-11-02 22:08:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-11-02 22:08:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-11-02 22:08:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-11-02 22:08:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-11-02 22:08:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-11-02 22:08:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-11-02 22:08:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-11-02 22:08:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-11-02 22:08:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-11-02 22:08:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-11-02 22:08:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-11-02 22:08:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-11-02 22:08:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-11-02 22:08:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-11-02 22:08:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-11-02 22:08:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-11-02 22:08:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-11-02 22:08:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-11-02 22:08:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-11-02 22:08:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-11-02 22:08:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-11-02 22:08:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-11-02 22:08:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-11-02 22:08:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-11-02 22:08:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-11-02 22:08:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-11-02 22:08:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-11-02 22:08:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-11-02 22:08:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-11-02 22:08:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-11-02 22:08:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-11-02 22:08:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-11-02 22:08:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-11-02 22:08:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-11-02 22:08:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-11-02 22:08:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-11-02 22:08:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-11-02 22:08:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-11-02 22:08:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-11-02 22:08:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-11-02 22:08:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-11-02 22:08:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-11-02 22:08:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-11-02 22:08:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-11-02 22:08:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-11-02 22:08:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-11-02 22:08:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-11-02 22:08:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-11-02 22:08:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-11-02 22:08:15,469 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-11-02 22:08:15,469 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-11-02 22:08:15,469 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-11-02 22:08:15,469 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-11-02 22:08:15,469 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-11-02 22:08:15,469 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-11-02 22:08:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-11-02 22:08:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-11-02 22:08:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-11-02 22:08:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-11-02 22:08:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-11-02 22:08:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-11-02 22:08:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-11-02 22:08:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-11-02 22:08:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:08:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-11-02 22:08:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 22:08:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 22:08:15,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-02 22:08:15,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 22:08:15,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-02 22:08:15,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 22:08:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-11-02 22:08:15,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-02 22:08:15,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:08:15,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-11-02 22:08:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-02 22:08:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-02 22:08:16,636 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:08:16,636 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-11-02 22:08:16,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:08:16 BoogieIcfgContainer [2021-11-02 22:08:16,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:08:16,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 22:08:16,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 22:08:16,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 22:08:16,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 10:08:14" (1/3) ... [2021-11-02 22:08:16,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a5ee34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:08:16, skipping insertion in model container [2021-11-02 22:08:16,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:15" (2/3) ... [2021-11-02 22:08:16,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a5ee34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:08:16, skipping insertion in model container [2021-11-02 22:08:16,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:08:16" (3/3) ... [2021-11-02 22:08:16,651 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2021-11-02 22:08:16,656 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 22:08:16,656 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2021-11-02 22:08:16,707 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 22:08:16,717 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-11-02 22:08:16,717 INFO L340 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2021-11-02 22:08:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 87 states have (on average 2.2298850574712645) internal successors, (194), 164 states have internal predecessors, (194), 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-11-02 22:08:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-02 22:08:16,741 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:16,742 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:16,742 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:16,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:16,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1610416047, now seen corresponding path program 1 times [2021-11-02 22:08:16,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:08:16,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322436516] [2021-11-02 22:08:16,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:16,767 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:08:16,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:08:16,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:08:16,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-02 22:08:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:16,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:08:16,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:17,039 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-11-02 22:08:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:17,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:08:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:17,093 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:08:17,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322436516] [2021-11-02 22:08:17,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322436516] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:17,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:17,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 22:08:17,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134738800] [2021-11-02 22:08:17,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:08:17,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:08:17,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:08:17,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:08:17,120 INFO L87 Difference]: Start difference. First operand has 169 states, 87 states have (on average 2.2298850574712645) internal successors, (194), 164 states have internal predecessors, (194), 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 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-02 22:08:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:17,465 INFO L93 Difference]: Finished difference Result 195 states and 202 transitions. [2021-11-02 22:08:17,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:08:17,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 7 [2021-11-02 22:08:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:17,480 INFO L225 Difference]: With dead ends: 195 [2021-11-02 22:08:17,480 INFO L226 Difference]: Without dead ends: 191 [2021-11-02 22:08:17,481 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:08:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-02 22:08:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 163. [2021-11-02 22:08:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 86 states have (on average 1.9186046511627908) internal successors, (165), 159 states have internal predecessors, (165), 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-11-02 22:08:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 168 transitions. [2021-11-02 22:08:17,552 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 168 transitions. Word has length 7 [2021-11-02 22:08:17,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:17,553 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 168 transitions. [2021-11-02 22:08:17,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-02 22:08:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 168 transitions. [2021-11-02 22:08:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-02 22:08:17,553 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:17,554 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:17,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-02 22:08:17,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:08:17,763 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:17,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:17,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1610416046, now seen corresponding path program 1 times [2021-11-02 22:08:17,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:08:17,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48346506] [2021-11-02 22:08:17,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:17,765 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:08:17,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:08:17,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:08:17,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-02 22:08:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:17,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 22:08:17,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:17,934 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-11-02 22:08:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:17,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:08:18,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:18,049 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:08:18,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48346506] [2021-11-02 22:08:18,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48346506] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:18,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:18,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-02 22:08:18,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398604688] [2021-11-02 22:08:18,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:08:18,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:08:18,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:08:18,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:08:18,053 INFO L87 Difference]: Start difference. First operand 163 states and 168 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-11-02 22:08:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:18,386 INFO L93 Difference]: Finished difference Result 160 states and 165 transitions. [2021-11-02 22:08:18,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:08:18,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2021-11-02 22:08:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:18,389 INFO L225 Difference]: With dead ends: 160 [2021-11-02 22:08:18,389 INFO L226 Difference]: Without dead ends: 160 [2021-11-02 22:08:18,390 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:08:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-11-02 22:08:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-11-02 22:08:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 86 states have (on average 1.8837209302325582) internal successors, (162), 156 states have internal predecessors, (162), 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-11-02 22:08:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 165 transitions. [2021-11-02 22:08:18,400 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 165 transitions. Word has length 7 [2021-11-02 22:08:18,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:18,401 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 165 transitions. [2021-11-02 22:08:18,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-11-02 22:08:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 165 transitions. [2021-11-02 22:08:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 22:08:18,402 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:18,402 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:18,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-02 22:08:18,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:08:18,612 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr6REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:18,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash -352660203, now seen corresponding path program 1 times [2021-11-02 22:08:18,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:08:18,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564359658] [2021-11-02 22:08:18,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:18,614 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:08:18,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:08:18,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:08:18,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-02 22:08:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:18,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:08:18,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:18,771 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-11-02 22:08:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:18,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:08:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:18,805 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:08:18,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564359658] [2021-11-02 22:08:18,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564359658] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:18,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:18,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 22:08:18,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527857989] [2021-11-02 22:08:18,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:08:18,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:08:18,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:08:18,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:08:18,808 INFO L87 Difference]: Start difference. First operand 160 states and 165 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-02 22:08:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:19,050 INFO L93 Difference]: Finished difference Result 159 states and 164 transitions. [2021-11-02 22:08:19,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:08:19,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11 [2021-11-02 22:08:19,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:19,052 INFO L225 Difference]: With dead ends: 159 [2021-11-02 22:08:19,052 INFO L226 Difference]: Without dead ends: 159 [2021-11-02 22:08:19,053 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:08:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-02 22:08:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2021-11-02 22:08:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 88 states have (on average 1.8068181818181819) internal successors, (159), 151 states have internal predecessors, (159), 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-11-02 22:08:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2021-11-02 22:08:19,062 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 11 [2021-11-02 22:08:19,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:19,062 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2021-11-02 22:08:19,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-02 22:08:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2021-11-02 22:08:19,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 22:08:19,063 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:19,063 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:19,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-02 22:08:19,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:08:19,275 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr7REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:19,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash -352660202, now seen corresponding path program 1 times [2021-11-02 22:08:19,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:08:19,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250565517] [2021-11-02 22:08:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:19,276 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:08:19,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:08:19,277 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:08:19,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-02 22:08:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:19,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 22:08:19,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:19,446 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-11-02 22:08:19,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:19,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:08:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:19,525 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:08:19,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250565517] [2021-11-02 22:08:19,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250565517] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:19,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:19,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-02 22:08:19,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004438838] [2021-11-02 22:08:19,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:08:19,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:08:19,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:08:19,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:08:19,527 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-11-02 22:08:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:19,914 INFO L93 Difference]: Finished difference Result 172 states and 178 transitions. [2021-11-02 22:08:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:08:19,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2021-11-02 22:08:19,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:19,916 INFO L225 Difference]: With dead ends: 172 [2021-11-02 22:08:19,917 INFO L226 Difference]: Without dead ends: 172 [2021-11-02 22:08:19,917 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:08:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-11-02 22:08:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2021-11-02 22:08:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 95 states have (on average 1.7157894736842105) internal successors, (163), 155 states have internal predecessors, (163), 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-11-02 22:08:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2021-11-02 22:08:19,929 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 11 [2021-11-02 22:08:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:19,929 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2021-11-02 22:08:19,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-11-02 22:08:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2021-11-02 22:08:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-02 22:08:19,930 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:19,930 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:19,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-02 22:08:20,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:08:20,137 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr12REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:20,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:20,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2117333470, now seen corresponding path program 1 times [2021-11-02 22:08:20,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:08:20,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051187215] [2021-11-02 22:08:20,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:20,138 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:08:20,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:08:20,139 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:08:20,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-02 22:08:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:20,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 22:08:20,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:20,335 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-11-02 22:08:20,404 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-02 22:08:20,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 24 [2021-11-02 22:08:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:20,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:08:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:20,532 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:08:20,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051187215] [2021-11-02 22:08:20,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051187215] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:20,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:20,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-02 22:08:20,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228979642] [2021-11-02 22:08:20,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:08:20,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:08:20,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:08:20,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:08:20,535 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-11-02 22:08:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:20,962 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2021-11-02 22:08:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:08:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 16 [2021-11-02 22:08:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:20,964 INFO L225 Difference]: With dead ends: 160 [2021-11-02 22:08:20,964 INFO L226 Difference]: Without dead ends: 160 [2021-11-02 22:08:20,965 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:08:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-11-02 22:08:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2021-11-02 22:08:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.5670103092783505) internal successors, (152), 142 states have internal predecessors, (152), 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-11-02 22:08:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2021-11-02 22:08:20,971 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 16 [2021-11-02 22:08:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:20,971 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2021-11-02 22:08:20,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-11-02 22:08:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2021-11-02 22:08:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-02 22:08:20,972 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:20,972 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:20,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-02 22:08:21,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:08:21,183 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:21,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2117333471, now seen corresponding path program 1 times [2021-11-02 22:08:21,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:08:21,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669476122] [2021-11-02 22:08:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:21,184 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:08:21,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:08:21,185 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:08:21,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-02 22:08:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:21,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 22:08:21,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:21,400 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-11-02 22:08:21,482 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-02 22:08:21,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-02 22:08:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:21,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:08:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:21,840 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:08:21,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669476122] [2021-11-02 22:08:21,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669476122] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:21,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:21,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2021-11-02 22:08:21,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852803082] [2021-11-02 22:08:21,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 22:08:21,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:08:21,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:08:21,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:08:21,842 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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-11-02 22:08:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:23,055 INFO L93 Difference]: Finished difference Result 193 states and 204 transitions. [2021-11-02 22:08:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 22:08:23,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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 16 [2021-11-02 22:08:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:23,057 INFO L225 Difference]: With dead ends: 193 [2021-11-02 22:08:23,057 INFO L226 Difference]: Without dead ends: 193 [2021-11-02 22:08:23,057 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:08:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-02 22:08:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 145. [2021-11-02 22:08:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 102 states have (on average 1.4901960784313726) internal successors, (152), 141 states have internal predecessors, (152), 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-11-02 22:08:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2021-11-02 22:08:23,063 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 16 [2021-11-02 22:08:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:23,064 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2021-11-02 22:08:23,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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-11-02 22:08:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2021-11-02 22:08:23,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-02 22:08:23,065 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:23,065 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:23,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-02 22:08:23,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:08:23,274 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr45ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:23,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:23,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1056980816, now seen corresponding path program 1 times [2021-11-02 22:08:23,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:08:23,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769207260] [2021-11-02 22:08:23,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:23,275 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:08:23,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:08:23,276 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:08:23,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-02 22:08:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:23,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 22:08:23,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:23,467 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-11-02 22:08:23,498 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-02 22:08:23,503 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 17 treesize of output 17 [2021-11-02 22:08:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:23,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:08:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:23,610 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:08:23,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769207260] [2021-11-02 22:08:23,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769207260] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:23,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:23,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-02 22:08:23,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215584589] [2021-11-02 22:08:23,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:08:23,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:08:23,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:08:23,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:08:23,612 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-11-02 22:08:23,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:23,998 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2021-11-02 22:08:24,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:08:24,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 18 [2021-11-02 22:08:24,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:24,014 INFO L225 Difference]: With dead ends: 193 [2021-11-02 22:08:24,015 INFO L226 Difference]: Without dead ends: 193 [2021-11-02 22:08:24,016 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:08:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-02 22:08:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 143. [2021-11-02 22:08:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 139 states have internal predecessors, (148), 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-11-02 22:08:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2021-11-02 22:08:24,023 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 18 [2021-11-02 22:08:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:24,024 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2021-11-02 22:08:24,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-11-02 22:08:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2021-11-02 22:08:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-02 22:08:24,026 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:24,026 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:24,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-02 22:08:24,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:08:24,238 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:24,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:24,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1591729511, now seen corresponding path program 1 times [2021-11-02 22:08:24,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:08:24,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773950441] [2021-11-02 22:08:24,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:24,239 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:08:24,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:08:24,240 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:08:24,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-02 22:08:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:24,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 22:08:24,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:24,459 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-11-02 22:08:24,475 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 20 treesize of output 16 [2021-11-02 22:08:24,502 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 21 treesize of output 13 [2021-11-02 22:08:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:24,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:08:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:24,580 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:08:24,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773950441] [2021-11-02 22:08:24,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773950441] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:24,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:24,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-02 22:08:24,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944900525] [2021-11-02 22:08:24,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:08:24,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:08:24,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:08:24,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:08:24,582 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-11-02 22:08:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:25,012 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2021-11-02 22:08:25,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 22:08:25,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 19 [2021-11-02 22:08:25,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:25,014 INFO L225 Difference]: With dead ends: 142 [2021-11-02 22:08:25,014 INFO L226 Difference]: Without dead ends: 142 [2021-11-02 22:08:25,014 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:08:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-02 22:08:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-11-02 22:08:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 101 states have (on average 1.4554455445544554) internal successors, (147), 138 states have internal predecessors, (147), 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-11-02 22:08:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2021-11-02 22:08:25,019 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 19 [2021-11-02 22:08:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:25,019 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2021-11-02 22:08:25,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-11-02 22:08:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2021-11-02 22:08:25,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-02 22:08:25,020 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:25,020 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:25,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-02 22:08:25,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:08:25,237 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr17REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:25,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:25,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1591729512, now seen corresponding path program 1 times [2021-11-02 22:08:25,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:08:25,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026082681] [2021-11-02 22:08:25,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:25,238 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:08:25,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:08:25,239 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:08:25,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-02 22:08:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:25,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 22:08:25,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:25,463 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-11-02 22:08:25,486 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-11-02 22:08:25,498 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 17 treesize of output 13 [2021-11-02 22:08:25,540 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 31 treesize of output 23 [2021-11-02 22:08:25,544 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 20 treesize of output 12 [2021-11-02 22:08:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:25,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:08:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:25,771 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:08:25,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026082681] [2021-11-02 22:08:25,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026082681] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:25,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:25,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-02 22:08:25,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694965946] [2021-11-02 22:08:25,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 22:08:25,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:08:25,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 22:08:25,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:08:25,773 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-11-02 22:08:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:26,734 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2021-11-02 22:08:26,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 22:08:26,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 19 [2021-11-02 22:08:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:26,735 INFO L225 Difference]: With dead ends: 141 [2021-11-02 22:08:26,736 INFO L226 Difference]: Without dead ends: 141 [2021-11-02 22:08:26,736 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-11-02 22:08:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-02 22:08:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-11-02 22:08:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 137 states have internal predecessors, (146), 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-11-02 22:08:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2021-11-02 22:08:26,740 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 19 [2021-11-02 22:08:26,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:26,741 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2021-11-02 22:08:26,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-11-02 22:08:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2021-11-02 22:08:26,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-02 22:08:26,742 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:26,742 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:26,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-02 22:08:26,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:08:26,948 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr48ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:26,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:26,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2106147056, now seen corresponding path program 1 times [2021-11-02 22:08:26,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:08:26,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408254641] [2021-11-02 22:08:26,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:26,953 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:08:26,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:08:26,955 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:08:26,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-02 22:08:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:27,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 22:08:27,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:27,216 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 13 treesize of output 9 [2021-11-02 22:08:27,331 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 15 treesize of output 7 [2021-11-02 22:08:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:27,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:08:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:27,432 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:08:27,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408254641] [2021-11-02 22:08:27,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408254641] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:27,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:27,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 8 [2021-11-02 22:08:27,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794359806] [2021-11-02 22:08:27,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 22:08:27,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:08:27,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 22:08:27,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:08:27,434 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-11-02 22:08:27,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:27,924 INFO L93 Difference]: Finished difference Result 198 states and 210 transitions. [2021-11-02 22:08:27,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 22:08:27,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 21 [2021-11-02 22:08:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:27,926 INFO L225 Difference]: With dead ends: 198 [2021-11-02 22:08:27,926 INFO L226 Difference]: Without dead ends: 198 [2021-11-02 22:08:27,926 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-02 22:08:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-02 22:08:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 146. [2021-11-02 22:08:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 142 states have internal predecessors, (151), 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-11-02 22:08:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2021-11-02 22:08:27,931 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 21 [2021-11-02 22:08:27,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:27,932 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2021-11-02 22:08:27,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-11-02 22:08:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2021-11-02 22:08:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-02 22:08:27,933 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:27,933 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:27,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-02 22:08:28,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:08:28,144 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:28,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:28,145 INFO L85 PathProgramCache]: Analyzing trace with hash 124262505, now seen corresponding path program 1 times [2021-11-02 22:08:28,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:08:28,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019792721] [2021-11-02 22:08:28,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:28,146 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:08:28,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:08:28,146 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:08:28,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-02 22:08:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:28,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-02 22:08:28,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:28,440 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-11-02 22:08:28,489 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-02 22:08:28,490 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 27 treesize of output 34 [2021-11-02 22:08:28,542 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 24 treesize of output 20 [2021-11-02 22:08:28,719 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-02 22:08:28,720 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 43 treesize of output 33 [2021-11-02 22:08:28,835 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-02 22:08:28,835 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 62 treesize of output 43 [2021-11-02 22:08:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:28,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:08:30,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem7.base|) (bvadd (_ bv4 32) |main_#t~mem7.offset|) c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset))))))))) (_ bv1 1)))) is different from false [2021-11-02 22:08:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:33,051 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:08:33,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019792721] [2021-11-02 22:08:33,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019792721] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:33,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:33,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2021-11-02 22:08:33,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591845577] [2021-11-02 22:08:33,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 22:08:33,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:08:33,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 22:08:33,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=1, NotChecked=22, Total=182 [2021-11-02 22:08:33,053 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 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-11-02 22:08:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:34,700 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2021-11-02 22:08:34,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 22:08:34,701 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 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 23 [2021-11-02 22:08:34,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:34,702 INFO L225 Difference]: With dead ends: 176 [2021-11-02 22:08:34,702 INFO L226 Difference]: Without dead ends: 176 [2021-11-02 22:08:34,703 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=132, Invalid=333, Unknown=1, NotChecked=40, Total=506 [2021-11-02 22:08:34,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-11-02 22:08:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2021-11-02 22:08:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 141 states have internal predecessors, (150), 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-11-02 22:08:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2021-11-02 22:08:34,707 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 23 [2021-11-02 22:08:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:34,708 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2021-11-02 22:08:34,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 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-11-02 22:08:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2021-11-02 22:08:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-02 22:08:34,709 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:34,709 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:34,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-02 22:08:34,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:08:34,909 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:08:34,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash 124262506, now seen corresponding path program 1 times [2021-11-02 22:08:34,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:08:34,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360661572] [2021-11-02 22:08:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:34,911 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:08:34,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:08:34,912 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:08:34,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-02 22:08:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:35,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-02 22:08:35,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:08:35,212 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-11-02 22:08:35,265 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-02 22:08:35,266 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 18 treesize of output 18 [2021-11-02 22:08:35,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-02 22:08:35,305 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-11-02 22:08:35,311 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-11-02 22:08:35,424 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-02 22:08:35,424 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 67 treesize of output 49 [2021-11-02 22:08:35,443 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-11-02 22:08:35,444 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 59 treesize of output 54 [2021-11-02 22:08:35,560 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-02 22:08:35,560 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 65 treesize of output 42 [2021-11-02 22:08:35,567 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-02 22:08:35,567 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 36 treesize of output 19 [2021-11-02 22:08:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:35,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:08:53,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:08:53,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:08:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:53,276 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:08:53,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360661572] [2021-11-02 22:08:53,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360661572] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:53,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:53,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2021-11-02 22:08:53,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842586996] [2021-11-02 22:08:53,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-02 22:08:53,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:08:53,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-02 22:08:53,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=195, Unknown=2, NotChecked=0, Total=240 [2021-11-02 22:08:53,279 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 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-11-02 22:09:26,004 WARN L207 SmtUtils]: Spent 6.08 s on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2021-11-02 22:09:28,574 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset))) (and (= (_ bv0 32) c_main_~end~0.offset) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) c_main_~end~0.offset)) (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |main_#t~mem7.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base|) .cse0 c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem7.base|) .cse0 c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| c_main_~end~0.base)))))) (_ bv1 1))) (exists ((|main_#t~mem7.offset| (_ BitVec 32))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset)) (.cse2 (bvadd (_ bv4 32) |main_#t~mem7.offset|))) (and (= c_main_~end~0.base (select (select |c_#memory_$Pointer$.base| .cse1) .cse2)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) c_main_~end~0.offset)))) (= (_ bv12 32) (select |c_#length| c_main_~end~0.base)) (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base|) (bvadd (_ bv4 32) |main_#t~mem7.offset|) c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| c_main_~list~0.base)) (_ bv1 1))) (= (select |c_#length| .cse4) (_ bv12 32)) (not (= .cse4 c_main_~end~0.base)))) is different from false [2021-11-02 22:09:43,803 WARN L207 SmtUtils]: Spent 14.23 s on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2021-11-02 22:09:48,928 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset))) (and (= (_ bv0 32) c_main_~end~0.offset) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) c_main_~end~0.offset)) (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |main_#t~mem7.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base|) .cse0 c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem7.base|) .cse0 c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| c_main_~end~0.base)))))) (_ bv1 1))) (exists ((|main_#t~mem7.offset| (_ BitVec 32))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset)) (.cse2 (bvadd (_ bv4 32) |main_#t~mem7.offset|))) (and (= c_main_~end~0.base (select (select |c_#memory_$Pointer$.base| .cse1) .cse2)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) c_main_~end~0.offset)))) (= (_ bv12 32) (select |c_#length| c_main_~end~0.base)) (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base|) (bvadd (_ bv4 32) |main_#t~mem7.offset|) c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (= (select |c_#length| .cse4) (_ bv12 32)) (not (= .cse4 c_main_~end~0.base)))) is different from false [2021-11-02 22:09:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:52,782 INFO L93 Difference]: Finished difference Result 278 states and 294 transitions. [2021-11-02 22:09:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-02 22:09:52,783 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 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 23 [2021-11-02 22:09:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:09:52,785 INFO L225 Difference]: With dead ends: 278 [2021-11-02 22:09:52,785 INFO L226 Difference]: Without dead ends: 278 [2021-11-02 22:09:52,787 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 71.3s TimeCoverageRelationStatistics Valid=503, Invalid=1750, Unknown=11, NotChecked=186, Total=2450 [2021-11-02 22:09:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-02 22:09:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 140. [2021-11-02 22:09:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 136 states have internal predecessors, (145), 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-11-02 22:09:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2021-11-02 22:09:52,797 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 23 [2021-11-02 22:09:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:09:52,798 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2021-11-02 22:09:52,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 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-11-02 22:09:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2021-11-02 22:09:52,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-02 22:09:52,805 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:09:52,805 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:09:52,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:53,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:09:53,020 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr53ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:09:53,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:53,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1488771985, now seen corresponding path program 1 times [2021-11-02 22:09:53,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:09:53,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552442730] [2021-11-02 22:09:53,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:53,021 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:09:53,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:09:53,022 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:09:53,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-02 22:09:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:53,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 22:09:53,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:53,353 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 13 treesize of output 9 [2021-11-02 22:09:53,511 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 15 treesize of output 7 [2021-11-02 22:09:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:53,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:09:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:53,680 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:09:53,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552442730] [2021-11-02 22:09:53,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552442730] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:09:53,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:09:53,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 9 [2021-11-02 22:09:53,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024579332] [2021-11-02 22:09:53,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 22:09:53,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:09:53,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:09:53,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:09:53,682 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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-11-02 22:09:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:54,608 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2021-11-02 22:09:54,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 22:09:54,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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 28 [2021-11-02 22:09:54,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:09:54,610 INFO L225 Difference]: With dead ends: 191 [2021-11-02 22:09:54,610 INFO L226 Difference]: Without dead ends: 191 [2021-11-02 22:09:54,611 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-02 22:09:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-02 22:09:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 144. [2021-11-02 22:09:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 140 states have internal predecessors, (149), 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-11-02 22:09:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2021-11-02 22:09:54,616 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 28 [2021-11-02 22:09:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:09:54,617 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2021-11-02 22:09:54,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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-11-02 22:09:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2021-11-02 22:09:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-02 22:09:54,618 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:09:54,618 INFO L513 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] [2021-11-02 22:09:54,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:54,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:09:54,829 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:09:54,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:54,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1530790238, now seen corresponding path program 1 times [2021-11-02 22:09:54,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:09:54,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751301656] [2021-11-02 22:09:54,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:54,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:09:54,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:09:54,833 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:09:54,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-02 22:09:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:55,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-02 22:09:55,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:55,198 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-11-02 22:09:55,210 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-11-02 22:09:55,260 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-02 22:09:55,261 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 21 treesize of output 20 [2021-11-02 22:09:55,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:55,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-02 22:09:55,401 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-11-02 22:09:55,401 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 36 treesize of output 23 [2021-11-02 22:09:55,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:55,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:55,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:55,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-02 22:09:55,846 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-02 22:09:55,846 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-11-02 22:09:55,853 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-02 22:09:55,854 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-11-02 22:09:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:55,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:09:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:56,293 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:09:56,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751301656] [2021-11-02 22:09:56,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751301656] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 22:09:56,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:09:56,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2021-11-02 22:09:56,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764825437] [2021-11-02 22:09:56,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-02 22:09:56,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:09:56,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 22:09:56,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-02 22:09:56,295 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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-11-02 22:09:58,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:58,002 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2021-11-02 22:09:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 22:09:58,002 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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 28 [2021-11-02 22:09:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:09:58,004 INFO L225 Difference]: With dead ends: 167 [2021-11-02 22:09:58,004 INFO L226 Difference]: Without dead ends: 167 [2021-11-02 22:09:58,004 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-11-02 22:09:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-11-02 22:09:58,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 147. [2021-11-02 22:09:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 113 states have (on average 1.345132743362832) internal successors, (152), 143 states have internal predecessors, (152), 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-11-02 22:09:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2021-11-02 22:09:58,010 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 28 [2021-11-02 22:09:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:09:58,011 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2021-11-02 22:09:58,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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-11-02 22:09:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2021-11-02 22:09:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-02 22:09:58,012 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:09:58,012 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:09:58,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:58,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:09:58,219 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr40ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:09:58,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:58,220 INFO L85 PathProgramCache]: Analyzing trace with hash 66805131, now seen corresponding path program 1 times [2021-11-02 22:09:58,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:09:58,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341852180] [2021-11-02 22:09:58,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:58,220 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:09:58,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:09:58,221 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:09:58,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-02 22:09:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:58,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 22:09:58,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:58,585 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 13 treesize of output 9 [2021-11-02 22:09:58,602 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 19 treesize of output 7 [2021-11-02 22:09:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:58,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:09:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:58,667 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:09:58,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341852180] [2021-11-02 22:09:58,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341852180] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:09:58,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:09:58,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-02 22:09:58,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511941135] [2021-11-02 22:09:58,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:09:58,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:09:58,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:09:58,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:09:58,669 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-11-02 22:09:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:59,058 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2021-11-02 22:09:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:09:59,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 28 [2021-11-02 22:09:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:09:59,061 INFO L225 Difference]: With dead ends: 149 [2021-11-02 22:09:59,061 INFO L226 Difference]: Without dead ends: 149 [2021-11-02 22:09:59,061 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:09:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-11-02 22:09:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2021-11-02 22:09:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 141 states have internal predecessors, (150), 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-11-02 22:09:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2021-11-02 22:09:59,066 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 28 [2021-11-02 22:09:59,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:09:59,067 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2021-11-02 22:09:59,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-11-02 22:09:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2021-11-02 22:09:59,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-02 22:09:59,068 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:09:59,075 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:09:59,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:59,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:09:59,287 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr30REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:09:59,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:59,288 INFO L85 PathProgramCache]: Analyzing trace with hash 36943448, now seen corresponding path program 1 times [2021-11-02 22:09:59,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:09:59,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218513962] [2021-11-02 22:09:59,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:59,288 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:09:59,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:09:59,290 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:09:59,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-02 22:09:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:59,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 22:09:59,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:59,687 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-11-02 22:09:59,701 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-11-02 22:09:59,721 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 21 treesize of output 13 [2021-11-02 22:09:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:59,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:09:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:59,807 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:09:59,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218513962] [2021-11-02 22:09:59,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218513962] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:09:59,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:09:59,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-02 22:09:59,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550179950] [2021-11-02 22:09:59,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:09:59,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:09:59,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:09:59,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:09:59,810 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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-11-02 22:10:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:10:00,374 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2021-11-02 22:10:00,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 22:10:00,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 30 [2021-11-02 22:10:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:10:00,375 INFO L225 Difference]: With dead ends: 144 [2021-11-02 22:10:00,375 INFO L226 Difference]: Without dead ends: 144 [2021-11-02 22:10:00,376 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:10:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-02 22:10:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-11-02 22:10:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 140 states have internal predecessors, (149), 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-11-02 22:10:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2021-11-02 22:10:00,381 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 30 [2021-11-02 22:10:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:10:00,381 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2021-11-02 22:10:00,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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-11-02 22:10:00,382 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2021-11-02 22:10:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-02 22:10:00,382 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:10:00,383 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:10:00,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:00,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:10:00,595 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr31REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:10:00,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:10:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash 36943449, now seen corresponding path program 1 times [2021-11-02 22:10:00,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:10:00,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323749138] [2021-11-02 22:10:00,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:10:00,596 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:10:00,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:10:00,597 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:10:00,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-02 22:10:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:10:00,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 22:10:00,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:01,023 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-11-02 22:10:01,047 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-11-02 22:10:01,060 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 17 treesize of output 13 [2021-11-02 22:10:01,101 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 31 treesize of output 23 [2021-11-02 22:10:01,105 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 20 treesize of output 12 [2021-11-02 22:10:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:10:01,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:10:01,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:10:01,397 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:10:01,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323749138] [2021-11-02 22:10:01,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323749138] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:10:01,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:10:01,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-02 22:10:01,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169892378] [2021-11-02 22:10:01,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 22:10:01,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:10:01,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 22:10:01,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:10:01,398 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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-11-02 22:10:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:10:02,560 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2021-11-02 22:10:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 22:10:02,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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 30 [2021-11-02 22:10:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:10:02,562 INFO L225 Difference]: With dead ends: 143 [2021-11-02 22:10:02,563 INFO L226 Difference]: Without dead ends: 143 [2021-11-02 22:10:02,563 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-11-02 22:10:02,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-02 22:10:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-11-02 22:10:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 139 states have internal predecessors, (148), 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-11-02 22:10:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2021-11-02 22:10:02,568 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 30 [2021-11-02 22:10:02,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:10:02,568 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2021-11-02 22:10:02,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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-11-02 22:10:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2021-11-02 22:10:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-02 22:10:02,569 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:10:02,569 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:10:02,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:02,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:10:02,782 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr43ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:10:02,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:10:02,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1625836410, now seen corresponding path program 1 times [2021-11-02 22:10:02,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:10:02,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995223368] [2021-11-02 22:10:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:10:02,784 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:10:02,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:10:02,785 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:10:02,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-02 22:10:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:10:03,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-02 22:10:03,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:03,317 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-11-02 22:10:03,325 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-11-02 22:10:03,384 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-02 22:10:03,384 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 27 treesize of output 11 [2021-11-02 22:10:03,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:03,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-02 22:10:03,468 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 29 treesize of output 21 [2021-11-02 22:10:03,471 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 18 treesize of output 10 [2021-11-02 22:10:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:10:03,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:10:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:10:03,652 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:10:03,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995223368] [2021-11-02 22:10:03,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995223368] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:10:03,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:10:03,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2021-11-02 22:10:03,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454961852] [2021-11-02 22:10:03,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 22:10:03,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:10:03,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:10:03,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:10:03,654 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-11-02 22:10:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:10:04,123 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2021-11-02 22:10:04,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:10:04,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 31 [2021-11-02 22:10:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:10:04,136 INFO L225 Difference]: With dead ends: 142 [2021-11-02 22:10:04,136 INFO L226 Difference]: Without dead ends: 142 [2021-11-02 22:10:04,136 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:10:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-02 22:10:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2021-11-02 22:10:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 137 states have internal predecessors, (146), 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-11-02 22:10:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2021-11-02 22:10:04,141 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 31 [2021-11-02 22:10:04,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:10:04,141 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2021-11-02 22:10:04,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-11-02 22:10:04,142 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2021-11-02 22:10:04,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-02 22:10:04,143 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:10:04,143 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:10:04,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-11-02 22:10:04,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:10:04,356 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:10:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:10:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash -939174818, now seen corresponding path program 1 times [2021-11-02 22:10:04,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:10:04,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514057042] [2021-11-02 22:10:04,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:10:04,357 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:10:04,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:10:04,358 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:10:04,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-02 22:10:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:10:04,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-02 22:10:04,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:04,789 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-11-02 22:10:04,819 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-02 22:10:04,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2021-11-02 22:10:04,970 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-02 22:10:04,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 42 [2021-11-02 22:10:05,002 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 20 treesize of output 16 [2021-11-02 22:10:05,094 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-02 22:10:05,094 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 38 treesize of output 28 [2021-11-02 22:10:05,179 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-02 22:10:05,180 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 37 treesize of output 18 [2021-11-02 22:10:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:10:05,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:10:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:10:13,574 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:10:13,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514057042] [2021-11-02 22:10:13,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514057042] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:10:13,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:10:13,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 8] imperfect sequences [] total 14 [2021-11-02 22:10:13,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83292785] [2021-11-02 22:10:13,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 22:10:13,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:10:13,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 22:10:13,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=146, Unknown=1, NotChecked=0, Total=182 [2021-11-02 22:10:13,577 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-11-02 22:10:26,329 WARN L207 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2021-11-02 22:10:28,352 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| c_main_~end~0.base)))))) (_ bv1 1))) (not (= c_main_~null~0.base c_main_~end~0.base)) (not (= |c_main_#t~mem8.base| c_main_~null~0.base)) (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (not (= c_main_~null~0.base (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem7.base|) (bvadd (_ bv4 32) |main_#t~mem7.offset|) c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset)))) (exists ((v_arrayElimCell_41 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_41)))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| c_main_~null~0.base)) .cse0))))) (exists ((|main_#t~mem7.offset| (_ BitVec 32))) (= c_main_~end~0.base (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset)) (bvadd (_ bv4 32) |main_#t~mem7.offset|)))) (not (= .cse1 c_main_~null~0.base)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| c_main_~list~0.base)) (_ bv1 1))) (not (= .cse1 c_main_~end~0.base)))) is different from false [2021-11-02 22:10:28,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:10:28,634 INFO L93 Difference]: Finished difference Result 273 states and 290 transitions. [2021-11-02 22:10:28,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-02 22:10:28,635 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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 33 [2021-11-02 22:10:28,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:10:28,636 INFO L225 Difference]: With dead ends: 273 [2021-11-02 22:10:28,637 INFO L226 Difference]: Without dead ends: 273 [2021-11-02 22:10:28,637 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=227, Invalid=645, Unknown=2, NotChecked=56, Total=930 [2021-11-02 22:10:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-02 22:10:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 197. [2021-11-02 22:10:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 167 states have (on average 1.2634730538922156) internal successors, (211), 193 states have internal predecessors, (211), 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-11-02 22:10:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 214 transitions. [2021-11-02 22:10:28,643 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 214 transitions. Word has length 33 [2021-11-02 22:10:28,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:10:28,644 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 214 transitions. [2021-11-02 22:10:28,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-11-02 22:10:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 214 transitions. [2021-11-02 22:10:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-02 22:10:28,645 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:10:28,645 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:10:28,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:28,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:10:28,858 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:10:28,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:10:28,859 INFO L85 PathProgramCache]: Analyzing trace with hash 703031177, now seen corresponding path program 1 times [2021-11-02 22:10:28,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:10:28,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763779425] [2021-11-02 22:10:28,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:10:28,859 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:10:28,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:10:28,860 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:10:28,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-02 22:10:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:10:29,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 22:10:29,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:29,265 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 13 treesize of output 9 [2021-11-02 22:10:29,351 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 19 treesize of output 7 [2021-11-02 22:10:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:10:29,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:10:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:10:29,511 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:10:29,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763779425] [2021-11-02 22:10:29,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763779425] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:10:29,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:10:29,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-02 22:10:29,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276480477] [2021-11-02 22:10:29,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:10:29,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:10:29,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:10:29,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:10:29,513 INFO L87 Difference]: Start difference. First operand 197 states and 214 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-11-02 22:10:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:10:29,726 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2021-11-02 22:10:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:10:29,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 34 [2021-11-02 22:10:29,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:10:29,738 INFO L225 Difference]: With dead ends: 207 [2021-11-02 22:10:29,738 INFO L226 Difference]: Without dead ends: 207 [2021-11-02 22:10:29,738 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:10:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-02 22:10:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2021-11-02 22:10:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 170 states have (on average 1.2588235294117647) internal successors, (214), 196 states have internal predecessors, (214), 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-11-02 22:10:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 217 transitions. [2021-11-02 22:10:29,745 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 217 transitions. Word has length 34 [2021-11-02 22:10:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:10:29,745 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 217 transitions. [2021-11-02 22:10:29,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-11-02 22:10:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 217 transitions. [2021-11-02 22:10:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-02 22:10:29,746 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:10:29,746 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:10:29,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:29,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:10:29,959 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr74ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:10:29,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:10:29,959 INFO L85 PathProgramCache]: Analyzing trace with hash 724025887, now seen corresponding path program 1 times [2021-11-02 22:10:29,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:10:29,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458117516] [2021-11-02 22:10:29,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:10:29,960 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:10:29,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:10:29,961 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:10:29,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-02 22:10:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:10:30,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:10:30,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:10:30,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:10:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:10:30,545 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:10:30,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458117516] [2021-11-02 22:10:30,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458117516] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:10:30,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:10:30,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 22:10:30,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914550310] [2021-11-02 22:10:30,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:10:30,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:10:30,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:10:30,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:10:30,547 INFO L87 Difference]: Start difference. First operand 200 states and 217 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-11-02 22:10:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:10:30,630 INFO L93 Difference]: Finished difference Result 202 states and 219 transitions. [2021-11-02 22:10:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:10:30,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 34 [2021-11-02 22:10:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:10:30,631 INFO L225 Difference]: With dead ends: 202 [2021-11-02 22:10:30,632 INFO L226 Difference]: Without dead ends: 202 [2021-11-02 22:10:30,632 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:10:30,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-02 22:10:30,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-11-02 22:10:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 172 states have (on average 1.255813953488372) internal successors, (216), 198 states have internal predecessors, (216), 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-11-02 22:10:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 219 transitions. [2021-11-02 22:10:30,638 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 219 transitions. Word has length 34 [2021-11-02 22:10:30,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:10:30,638 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 219 transitions. [2021-11-02 22:10:30,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-11-02 22:10:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 219 transitions. [2021-11-02 22:10:30,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-02 22:10:30,639 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:10:30,640 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:10:30,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:30,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:10:30,852 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:10:30,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:10:30,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1167972262, now seen corresponding path program 1 times [2021-11-02 22:10:30,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:10:30,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764177647] [2021-11-02 22:10:30,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:10:30,853 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:10:30,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:10:30,854 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:10:30,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-02 22:10:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:10:31,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-02 22:10:31,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:31,505 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-02 22:10:31,505 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 24 treesize of output 31 [2021-11-02 22:10:31,555 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 25 treesize of output 21 [2021-11-02 22:10:31,730 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-02 22:10:31,730 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 45 treesize of output 35 [2021-11-02 22:10:31,852 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-02 22:10:31,852 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 65 treesize of output 46 [2021-11-02 22:10:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:10:31,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:10:33,869 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem11.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem11.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem11.base|) (bvadd |main_#t~mem11.offset| (_ bv4 32)) c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset)))))))) (_ bv1 1)))) is different from false [2021-11-02 22:10:35,685 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem11.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd |main_#t~mem11.offset| (_ bv4 32)) c_main_~end~0.base))) c_main_~end~0.base) c_main_~end~0.offset))))))))))) is different from false [2021-11-02 22:10:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:10:35,780 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:10:35,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764177647] [2021-11-02 22:10:35,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764177647] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:10:35,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:10:35,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2021-11-02 22:10:35,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113709432] [2021-11-02 22:10:35,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 22:10:35,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:10:35,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 22:10:35,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=97, Unknown=2, NotChecked=42, Total=182 [2021-11-02 22:10:35,782 INFO L87 Difference]: Start difference. First operand 202 states and 219 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 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-11-02 22:10:37,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:10:37,102 INFO L93 Difference]: Finished difference Result 219 states and 236 transitions. [2021-11-02 22:10:37,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 22:10:37,102 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 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 34 [2021-11-02 22:10:37,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:10:37,104 INFO L225 Difference]: With dead ends: 219 [2021-11-02 22:10:37,104 INFO L226 Difference]: Without dead ends: 219 [2021-11-02 22:10:37,104 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=66, Invalid=150, Unknown=2, NotChecked=54, Total=272 [2021-11-02 22:10:37,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-11-02 22:10:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 201. [2021-11-02 22:10:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 172 states have (on average 1.244186046511628) internal successors, (214), 197 states have internal predecessors, (214), 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-11-02 22:10:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 217 transitions. [2021-11-02 22:10:37,110 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 217 transitions. Word has length 34 [2021-11-02 22:10:37,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:10:37,110 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 217 transitions. [2021-11-02 22:10:37,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 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-11-02 22:10:37,111 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 217 transitions. [2021-11-02 22:10:37,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-02 22:10:37,112 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:10:37,112 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:10:37,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:37,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:10:37,312 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:10:37,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:10:37,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1167972261, now seen corresponding path program 1 times [2021-11-02 22:10:37,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:10:37,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831592534] [2021-11-02 22:10:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:10:37,313 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:10:37,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:10:37,314 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:10:37,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-11-02 22:10:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:10:37,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-02 22:10:37,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:38,004 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-11-02 22:10:38,043 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-11-02 22:10:38,071 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-02 22:10:38,071 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 29 treesize of output 36 [2021-11-02 22:10:38,121 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 29 treesize of output 25 [2021-11-02 22:10:38,289 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-02 22:10:38,290 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 55 treesize of output 41 [2021-11-02 22:10:38,432 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-02 22:10:38,432 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 79 treesize of output 56 [2021-11-02 22:10:38,714 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-02 22:10:38,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-02 22:10:38,749 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-02 22:10:38,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 56 treesize of output 58 [2021-11-02 22:10:38,812 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-11-02 22:10:38,819 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-11-02 22:10:38,981 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-02 22:10:38,982 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 67 treesize of output 49 [2021-11-02 22:10:39,000 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-11-02 22:10:39,000 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 59 treesize of output 54 [2021-11-02 22:10:39,113 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-02 22:10:39,114 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 70 treesize of output 47 [2021-11-02 22:10:39,120 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-02 22:10:39,121 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 41 treesize of output 24 [2021-11-02 22:10:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:10:39,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:11:08,483 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd (_ bv4 32) |main_#t~mem7.offset|) c_main_~end~0.base))) c_main_~end~0.base) c_main_~end~0.offset))))))))) (_ bv1 1)))) is different from false [2021-11-02 22:11:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:11:08,587 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:11:08,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831592534] [2021-11-02 22:11:08,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831592534] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:11:08,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:11:08,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [] total 26 [2021-11-02 22:11:08,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108648505] [2021-11-02 22:11:08,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-02 22:11:08,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:11:08,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-02 22:11:08,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=566, Unknown=7, NotChecked=48, Total=702 [2021-11-02 22:11:08,588 INFO L87 Difference]: Start difference. First operand 201 states and 217 transitions. Second operand has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 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-11-02 22:11:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:11:19,521 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2021-11-02 22:11:19,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-02 22:11:19,523 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 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 34 [2021-11-02 22:11:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:11:19,524 INFO L225 Difference]: With dead ends: 237 [2021-11-02 22:11:19,524 INFO L226 Difference]: Without dead ends: 237 [2021-11-02 22:11:19,526 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=697, Invalid=3082, Unknown=7, NotChecked=120, Total=3906 [2021-11-02 22:11:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-11-02 22:11:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 197. [2021-11-02 22:11:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 171 states have (on average 1.2105263157894737) internal successors, (207), 193 states have internal predecessors, (207), 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-11-02 22:11:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 210 transitions. [2021-11-02 22:11:19,532 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 210 transitions. Word has length 34 [2021-11-02 22:11:19,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:11:19,533 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 210 transitions. [2021-11-02 22:11:19,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 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-11-02 22:11:19,533 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 210 transitions. [2021-11-02 22:11:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-02 22:11:19,534 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:11:19,534 INFO L513 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] [2021-11-02 22:11:19,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-11-02 22:11:19,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:11:19,748 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr60REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:11:19,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:11:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash 129788422, now seen corresponding path program 1 times [2021-11-02 22:11:19,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:11:19,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635561335] [2021-11-02 22:11:19,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:11:19,750 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:11:19,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:11:19,751 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:11:19,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-11-02 22:11:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:11:20,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-02 22:11:20,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:11:20,729 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 29 treesize of output 21 [2021-11-02 22:11:20,732 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 18 treesize of output 10 [2021-11-02 22:11:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:11:20,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:11:21,268 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-02 22:11:21,269 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-11-02 22:11:21,277 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-11-02 22:11:21,278 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2021-11-02 22:11:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:11:21,436 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:11:21,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635561335] [2021-11-02 22:11:21,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635561335] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 22:11:21,436 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:11:21,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-11-02 22:11:21,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432871614] [2021-11-02 22:11:21,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 22:11:21,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:11:21,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 22:11:21,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-11-02 22:11:21,438 INFO L87 Difference]: Start difference. First operand 197 states and 210 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 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-11-02 22:11:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:11:23,207 INFO L93 Difference]: Finished difference Result 249 states and 266 transitions. [2021-11-02 22:11:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 22:11:23,207 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 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 37 [2021-11-02 22:11:23,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:11:23,208 INFO L225 Difference]: With dead ends: 249 [2021-11-02 22:11:23,208 INFO L226 Difference]: Without dead ends: 249 [2021-11-02 22:11:23,209 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2021-11-02 22:11:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-11-02 22:11:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 208. [2021-11-02 22:11:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 182 states have (on average 1.2087912087912087) internal successors, (220), 204 states have internal predecessors, (220), 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-11-02 22:11:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 223 transitions. [2021-11-02 22:11:23,214 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 223 transitions. Word has length 37 [2021-11-02 22:11:23,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:11:23,215 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 223 transitions. [2021-11-02 22:11:23,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 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-11-02 22:11:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 223 transitions. [2021-11-02 22:11:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-02 22:11:23,216 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:11:23,216 INFO L513 BasicCegarLoop]: trace histogram [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-11-02 22:11:23,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-11-02 22:11:23,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:11:23,428 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr76ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-11-02 22:11:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:11:23,428 INFO L85 PathProgramCache]: Analyzing trace with hash -271526566, now seen corresponding path program 1 times [2021-11-02 22:11:23,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:11:23,429 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737677596] [2021-11-02 22:11:23,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:11:23,429 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:11:23,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:11:23,430 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:11:23,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-11-02 22:11:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:11:23,941 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:11:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:11:24,086 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-11-02 22:11:24,086 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-02 22:11:24,087 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr76ENSURES_VIOLATIONMEMORY_LEAK [2021-11-02 22:11:24,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-11-02 22:11:24,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-11-02 22:11:24,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-11-02 22:11:24,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-11-02 22:11:24,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-11-02 22:11:24,090 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-11-02 22:11:24,090 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-11-02 22:11:24,090 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-11-02 22:11:24,090 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-11-02 22:11:24,090 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-11-02 22:11:24,090 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-11-02 22:11:24,090 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-11-02 22:11:24,090 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-11-02 22:11:24,091 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-11-02 22:11:24,091 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-11-02 22:11:24,091 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-11-02 22:11:24,091 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-11-02 22:11:24,091 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-11-02 22:11:24,091 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-11-02 22:11:24,092 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-11-02 22:11:24,092 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-11-02 22:11:24,092 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-11-02 22:11:24,092 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-11-02 22:11:24,092 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-11-02 22:11:24,092 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-11-02 22:11:24,093 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-11-02 22:11:24,093 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-11-02 22:11:24,093 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-11-02 22:11:24,093 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-11-02 22:11:24,093 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-11-02 22:11:24,093 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-11-02 22:11:24,094 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-11-02 22:11:24,094 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-11-02 22:11:24,094 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-11-02 22:11:24,094 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-11-02 22:11:24,094 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-11-02 22:11:24,094 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-11-02 22:11:24,095 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-11-02 22:11:24,095 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-11-02 22:11:24,095 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-11-02 22:11:24,095 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:11:24,095 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-11-02 22:11:24,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-11-02 22:11:24,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:11:24,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:11:24,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:11:24,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-11-02 22:11:24,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-11-02 22:11:24,097 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:11:24,097 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-11-02 22:11:24,097 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-11-02 22:11:24,097 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51REQUIRES_VIOLATION [2021-11-02 22:11:24,097 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-11-02 22:11:24,097 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:11:24,098 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION [2021-11-02 22:11:24,098 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-11-02 22:11:24,098 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:11:24,098 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57REQUIRES_VIOLATION [2021-11-02 22:11:24,098 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-11-02 22:11:24,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-11-02 22:11:24,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-11-02 22:11:24,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-11-02 22:11:24,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-11-02 22:11:24,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:11:24,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:11:24,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:11:24,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-11-02 22:11:24,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67REQUIRES_VIOLATION [2021-11-02 22:11:24,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:11:24,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:11:24,101 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:11:24,101 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71REQUIRES_VIOLATION [2021-11-02 22:11:24,101 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72REQUIRES_VIOLATION [2021-11-02 22:11:24,101 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:11:24,101 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:11:24,102 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:11:24,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-11-02 22:11:24,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:11:24,318 INFO L731 BasicCegarLoop]: Path program histogram: [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-11-02 22:11:24,322 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 22:11:24,338 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-11-02 22:11:24,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 10:11:24 BoogieIcfgContainer [2021-11-02 22:11:24,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 22:11:24,356 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 22:11:24,356 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 22:11:24,356 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 22:11:24,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:08:16" (3/4) ... [2021-11-02 22:11:24,360 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-02 22:11:24,360 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 22:11:24,361 INFO L168 Benchmark]: Toolchain (without parser) took 189698.06 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 60.8 MB in the beginning and 46.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 49.4 MB. Max. memory is 16.1 GB. [2021-11-02 22:11:24,361 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 75.5 MB. Free memory was 57.7 MB in the beginning and 57.7 MB in the end (delta: 63.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:11:24,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 603.35 ms. Allocated memory is still 75.5 MB. Free memory was 60.4 MB in the beginning and 51.5 MB in the end (delta: 8.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. [2021-11-02 22:11:24,362 INFO L168 Benchmark]: Boogie Preprocessor took 106.38 ms. Allocated memory is still 75.5 MB. Free memory was 51.5 MB in the beginning and 48.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 22:11:24,362 INFO L168 Benchmark]: RCFGBuilder took 1266.01 ms. Allocated memory is still 75.5 MB. Free memory was 48.0 MB in the beginning and 39.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.1 GB. [2021-11-02 22:11:24,363 INFO L168 Benchmark]: TraceAbstraction took 187711.90 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 39.3 MB in the beginning and 46.3 MB in the end (delta: -7.0 MB). Peak memory consumption was 28.9 MB. Max. memory is 16.1 GB. [2021-11-02 22:11:24,363 INFO L168 Benchmark]: Witness Printer took 3.96 ms. Allocated memory is still 111.1 MB. Free memory is still 46.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:11:24,364 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.22 ms. Allocated memory is still 75.5 MB. Free memory was 57.7 MB in the beginning and 57.7 MB in the end (delta: 63.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 603.35 ms. Allocated memory is still 75.5 MB. Free memory was 60.4 MB in the beginning and 51.5 MB in the end (delta: 8.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 106.38 ms. Allocated memory is still 75.5 MB. Free memory was 51.5 MB in the beginning and 48.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1266.01 ms. Allocated memory is still 75.5 MB. Free memory was 48.0 MB in the beginning and 39.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 187711.90 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 39.3 MB in the beginning and 46.3 MB in the end (delta: -7.0 MB). Peak memory consumption was 28.9 MB. Max. memory is 16.1 GB. * Witness Printer took 3.96 ms. Allocated memory is still 111.1 MB. Free memory is still 46.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); [L999] null->next = ((void*)0) VAL [null={1:0}] [L1000] null->prev = ((void*)0) VAL [null={1:0}] [L1001] null->colour = BLACK VAL [null={1:0}] [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null VAL [list={2:0}, null={1:0}] [L1005] list->prev = null VAL [list={2:0}, null={1:0}] [L1006] list->colour = BLACK VAL [list={2:0}, null={1:0}] [L1008] struct TSLL* end = list; VAL [end={2:0}, list={2:0}, null={1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={2:0}, list={2:0}, null={1:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={2:0}, list={2:0}, null={1:0}] [L1042] EXPR end->colour VAL [end={2:0}, end->colour=1, list={2:0}, null={1:0}] [L1042] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE null != end VAL [end={2:0}, list={2:0}, null={1:0}] [L1045] EXPR end->colour VAL [end={2:0}, end->colour=1, list={2:0}, null={1:0}] [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next VAL [end={2:0}, end->next={1:0}, list={2:0}, null={1:0}] [L1052] end = end->next [L1043] COND FALSE !(null != end) VAL [end={1:0}, list={2:0}, null={1:0}] [L1056] COND TRUE null != list VAL [end={1:0}, list={2:0}, null={1:0}] [L1058] EXPR list->colour VAL [end={1:0}, list={2:0}, list->colour=1, null={1:0}] [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next VAL [end={1:0}, list={2:0}, list->next={1:0}, null={1:0}] [L1067] end = list->next [L1068] free(list) VAL [end={1:0}, list={2:0}, null={1:0}] [L1068] free(list) VAL [end={1:0}, list={2:0}, null={1:0}] [L1068] free(list) [L1069] list = end VAL [end={1:0}, list={1:0}, null={1:0}] [L1056] COND FALSE !(null != list) VAL [end={1:0}, list={1:0}, null={1:0}] [L1073] return 0; VAL [\result=0, end={1:0}, list={1:0}, null={1:0}] - 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: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: 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: 1032]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1048]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: 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 free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free 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: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: 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 free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 77 error locations. Started 1 CEGAR loops. OverallTime: 187.6s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 101.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2233 SDtfs, 3809 SDslu, 5437 SDs, 0 SdLazy, 7077 SolverSat, 403 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1260 GetRequests, 946 SyntacticMatches, 20 SemanticMatches, 294 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1847 ImplicationChecksByTransitivity, 141.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=24, InterpolantAutomatonStates: 241, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 632 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 73.0s InterpolantComputationTime, 610 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1096 ConstructedInterpolants, 59 QuantifiedInterpolants, 7745 SizeOfPredicates, 129 NumberOfNonLiveVariables, 3280 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 48 InterpolantComputations, 44 PerfectInterpolantSequences, 8/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-02 22:11:24,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c0c240-c842-4352-8fc7-73fae352598b/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample