./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 6423b7e5fbcc52c08e52aff49c79db620dd407c4 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 03:55:12,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 03:55:12,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 03:55:12,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 03:55:12,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 03:55:12,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 03:55:12,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 03:55:12,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 03:55:12,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 03:55:12,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 03:55:12,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 03:55:12,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 03:55:12,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 03:55:12,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 03:55:12,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 03:55:12,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 03:55:12,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 03:55:12,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 03:55:12,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 03:55:12,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 03:55:12,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 03:55:12,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 03:55:12,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 03:55:12,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 03:55:12,889 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 03:55:12,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 03:55:12,890 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 03:55:12,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 03:55:12,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 03:55:12,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 03:55:12,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 03:55:12,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 03:55:12,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 03:55:12,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 03:55:12,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 03:55:12,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 03:55:12,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 03:55:12,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 03:55:12,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 03:55:12,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 03:55:12,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 03:55:12,918 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-10-26 03:55:12,967 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 03:55:12,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 03:55:12,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 03:55:12,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 03:55:12,971 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 03:55:12,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 03:55:12,971 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 03:55:12,972 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 03:55:12,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 03:55:12,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 03:55:12,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 03:55:12,973 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-26 03:55:12,973 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-26 03:55:12,974 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-26 03:55:12,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 03:55:12,974 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-26 03:55:12,975 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 03:55:12,975 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 03:55:12,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 03:55:12,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 03:55:12,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 03:55:12,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 03:55:12,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 03:55:12,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 03:55:12,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 03:55:12,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 03:55:12,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 03:55:12,978 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 03:55:12,979 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 6423b7e5fbcc52c08e52aff49c79db620dd407c4 [2020-10-26 03:55:13,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 03:55:13,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 03:55:13,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 03:55:13,427 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 03:55:13,428 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 03:55:13,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2020-10-26 03:55:13,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95b2b3291/f7ff3d8fb2e4404e83651d6298b1b0ee/FLAG8d0980542 [2020-10-26 03:55:14,216 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 03:55:14,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2020-10-26 03:55:14,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95b2b3291/f7ff3d8fb2e4404e83651d6298b1b0ee/FLAG8d0980542 [2020-10-26 03:55:14,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95b2b3291/f7ff3d8fb2e4404e83651d6298b1b0ee [2020-10-26 03:55:14,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 03:55:14,599 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-26 03:55:14,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 03:55:14,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 03:55:14,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 03:55:14,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:55:14" (1/1) ... [2020-10-26 03:55:14,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f9ded9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:14, skipping insertion in model container [2020-10-26 03:55:14,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:55:14" (1/1) ... [2020-10-26 03:55:14,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 03:55:14,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 03:55:14,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 03:55:14,951 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 03:55:14,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 03:55:14,997 INFO L208 MainTranslator]: Completed translation [2020-10-26 03:55:14,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:14 WrapperNode [2020-10-26 03:55:14,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 03:55:14,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 03:55:14,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 03:55:14,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 03:55:15,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:14" (1/1) ... [2020-10-26 03:55:15,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:14" (1/1) ... [2020-10-26 03:55:15,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:14" (1/1) ... [2020-10-26 03:55:15,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:14" (1/1) ... [2020-10-26 03:55:15,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:14" (1/1) ... [2020-10-26 03:55:15,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:14" (1/1) ... [2020-10-26 03:55:15,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:14" (1/1) ... [2020-10-26 03:55:15,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 03:55:15,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 03:55:15,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 03:55:15,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 03:55:15,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 03:55:15,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-26 03:55:15,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 03:55:15,131 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-26 03:55:15,131 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-26 03:55:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-26 03:55:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-26 03:55:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-26 03:55:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 03:55:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-26 03:55:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-26 03:55:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-26 03:55:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 03:55:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 03:55:15,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 03:55:15,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 03:55:15,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 03:55:15,628 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 03:55:15,628 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-26 03:55:15,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:55:15 BoogieIcfgContainer [2020-10-26 03:55:15,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 03:55:15,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 03:55:15,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 03:55:15,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 03:55:15,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 03:55:14" (1/3) ... [2020-10-26 03:55:15,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75801810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:55:15, skipping insertion in model container [2020-10-26 03:55:15,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:14" (2/3) ... [2020-10-26 03:55:15,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75801810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:55:15, skipping insertion in model container [2020-10-26 03:55:15,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:55:15" (3/3) ... [2020-10-26 03:55:15,647 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2020-10-26 03:55:15,660 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 03:55:15,665 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-26 03:55:15,679 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-26 03:55:15,713 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 03:55:15,713 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-26 03:55:15,713 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 03:55:15,713 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 03:55:15,714 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 03:55:15,715 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 03:55:15,715 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 03:55:15,715 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 03:55:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-10-26 03:55:15,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-26 03:55:15,745 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:15,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:55:15,747 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:15,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:15,753 INFO L82 PathProgramCache]: Analyzing trace with hash -853069560, now seen corresponding path program 1 times [2020-10-26 03:55:15,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:15,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430278070] [2020-10-26 03:55:15,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:16,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:16,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430278070] [2020-10-26 03:55:16,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:16,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 03:55:16,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987841801] [2020-10-26 03:55:16,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 03:55:16,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:16,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 03:55:16,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 03:55:16,152 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2020-10-26 03:55:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:16,222 INFO L93 Difference]: Finished difference Result 46 states and 75 transitions. [2020-10-26 03:55:16,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 03:55:16,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-26 03:55:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:16,237 INFO L225 Difference]: With dead ends: 46 [2020-10-26 03:55:16,237 INFO L226 Difference]: Without dead ends: 41 [2020-10-26 03:55:16,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 03:55:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-26 03:55:16,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-26 03:55:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-26 03:55:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 70 transitions. [2020-10-26 03:55:16,300 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 70 transitions. Word has length 9 [2020-10-26 03:55:16,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:16,301 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 70 transitions. [2020-10-26 03:55:16,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 03:55:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 70 transitions. [2020-10-26 03:55:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 03:55:16,305 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:16,306 INFO L422 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] [2020-10-26 03:55:16,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 03:55:16,307 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:16,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1308951589, now seen corresponding path program 1 times [2020-10-26 03:55:16,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:16,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657285800] [2020-10-26 03:55:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:16,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:16,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657285800] [2020-10-26 03:55:16,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:16,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:16,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879862119] [2020-10-26 03:55:16,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:16,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:16,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:16,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:16,528 INFO L87 Difference]: Start difference. First operand 41 states and 70 transitions. Second operand 4 states. [2020-10-26 03:55:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:16,731 INFO L93 Difference]: Finished difference Result 73 states and 130 transitions. [2020-10-26 03:55:16,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:16,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-26 03:55:16,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:16,735 INFO L225 Difference]: With dead ends: 73 [2020-10-26 03:55:16,735 INFO L226 Difference]: Without dead ends: 73 [2020-10-26 03:55:16,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-26 03:55:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 52. [2020-10-26 03:55:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-26 03:55:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 91 transitions. [2020-10-26 03:55:16,746 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 91 transitions. Word has length 22 [2020-10-26 03:55:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:16,747 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 91 transitions. [2020-10-26 03:55:16,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 91 transitions. [2020-10-26 03:55:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 03:55:16,748 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:16,748 INFO L422 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] [2020-10-26 03:55:16,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 03:55:16,749 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:16,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:16,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1974898457, now seen corresponding path program 1 times [2020-10-26 03:55:16,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:16,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045867071] [2020-10-26 03:55:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:16,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:16,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045867071] [2020-10-26 03:55:16,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:16,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:16,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935799734] [2020-10-26 03:55:16,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:16,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:16,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:16,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:16,850 INFO L87 Difference]: Start difference. First operand 52 states and 91 transitions. Second operand 4 states. [2020-10-26 03:55:17,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:17,032 INFO L93 Difference]: Finished difference Result 73 states and 128 transitions. [2020-10-26 03:55:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:17,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-26 03:55:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:17,034 INFO L225 Difference]: With dead ends: 73 [2020-10-26 03:55:17,034 INFO L226 Difference]: Without dead ends: 73 [2020-10-26 03:55:17,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:17,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-26 03:55:17,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2020-10-26 03:55:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-26 03:55:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 127 transitions. [2020-10-26 03:55:17,044 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 127 transitions. Word has length 22 [2020-10-26 03:55:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:17,044 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 127 transitions. [2020-10-26 03:55:17,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 127 transitions. [2020-10-26 03:55:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-26 03:55:17,046 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:17,046 INFO L422 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] [2020-10-26 03:55:17,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 03:55:17,047 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:17,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:17,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1916186131, now seen corresponding path program 1 times [2020-10-26 03:55:17,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:17,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487344731] [2020-10-26 03:55:17,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:17,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:17,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487344731] [2020-10-26 03:55:17,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:17,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:17,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671383015] [2020-10-26 03:55:17,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:17,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:17,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:17,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:17,124 INFO L87 Difference]: Start difference. First operand 72 states and 127 transitions. Second operand 4 states. [2020-10-26 03:55:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:17,289 INFO L93 Difference]: Finished difference Result 76 states and 130 transitions. [2020-10-26 03:55:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:17,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-26 03:55:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:17,291 INFO L225 Difference]: With dead ends: 76 [2020-10-26 03:55:17,291 INFO L226 Difference]: Without dead ends: 76 [2020-10-26 03:55:17,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-26 03:55:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2020-10-26 03:55:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-26 03:55:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 129 transitions. [2020-10-26 03:55:17,300 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 129 transitions. Word has length 23 [2020-10-26 03:55:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:17,300 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 129 transitions. [2020-10-26 03:55:17,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:17,301 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 129 transitions. [2020-10-26 03:55:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-26 03:55:17,302 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:17,302 INFO L422 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] [2020-10-26 03:55:17,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 03:55:17,306 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:17,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:17,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1098917487, now seen corresponding path program 1 times [2020-10-26 03:55:17,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:17,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971867241] [2020-10-26 03:55:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:17,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:17,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971867241] [2020-10-26 03:55:17,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:17,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:17,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200868301] [2020-10-26 03:55:17,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:17,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:17,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:17,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:17,377 INFO L87 Difference]: Start difference. First operand 75 states and 129 transitions. Second operand 4 states. [2020-10-26 03:55:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:17,551 INFO L93 Difference]: Finished difference Result 137 states and 239 transitions. [2020-10-26 03:55:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:17,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-26 03:55:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:17,553 INFO L225 Difference]: With dead ends: 137 [2020-10-26 03:55:17,553 INFO L226 Difference]: Without dead ends: 137 [2020-10-26 03:55:17,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-26 03:55:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2020-10-26 03:55:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-10-26 03:55:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 238 transitions. [2020-10-26 03:55:17,565 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 238 transitions. Word has length 23 [2020-10-26 03:55:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:17,566 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 238 transitions. [2020-10-26 03:55:17,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 238 transitions. [2020-10-26 03:55:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-26 03:55:17,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:17,567 INFO L422 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] [2020-10-26 03:55:17,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 03:55:17,568 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:17,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2110034737, now seen corresponding path program 1 times [2020-10-26 03:55:17,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:17,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509044676] [2020-10-26 03:55:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:17,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:17,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509044676] [2020-10-26 03:55:17,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:17,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:17,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734011814] [2020-10-26 03:55:17,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:17,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:17,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:17,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:17,659 INFO L87 Difference]: Start difference. First operand 136 states and 238 transitions. Second operand 4 states. [2020-10-26 03:55:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:17,818 INFO L93 Difference]: Finished difference Result 173 states and 305 transitions. [2020-10-26 03:55:17,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:17,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-26 03:55:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:17,820 INFO L225 Difference]: With dead ends: 173 [2020-10-26 03:55:17,820 INFO L226 Difference]: Without dead ends: 173 [2020-10-26 03:55:17,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-26 03:55:17,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 136. [2020-10-26 03:55:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-10-26 03:55:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 236 transitions. [2020-10-26 03:55:17,829 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 236 transitions. Word has length 23 [2020-10-26 03:55:17,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:17,829 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 236 transitions. [2020-10-26 03:55:17,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 236 transitions. [2020-10-26 03:55:17,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-26 03:55:17,831 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:17,831 INFO L422 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] [2020-10-26 03:55:17,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 03:55:17,832 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:17,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:17,832 INFO L82 PathProgramCache]: Analyzing trace with hash -286678236, now seen corresponding path program 1 times [2020-10-26 03:55:17,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:17,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11860856] [2020-10-26 03:55:17,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:17,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:17,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11860856] [2020-10-26 03:55:17,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:17,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:17,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526453230] [2020-10-26 03:55:17,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:17,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:17,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:17,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:17,906 INFO L87 Difference]: Start difference. First operand 136 states and 236 transitions. Second operand 4 states. [2020-10-26 03:55:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:18,056 INFO L93 Difference]: Finished difference Result 249 states and 439 transitions. [2020-10-26 03:55:18,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:18,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-26 03:55:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:18,058 INFO L225 Difference]: With dead ends: 249 [2020-10-26 03:55:18,058 INFO L226 Difference]: Without dead ends: 249 [2020-10-26 03:55:18,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:18,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-10-26 03:55:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 184. [2020-10-26 03:55:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-26 03:55:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 318 transitions. [2020-10-26 03:55:18,068 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 318 transitions. Word has length 24 [2020-10-26 03:55:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:18,068 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 318 transitions. [2020-10-26 03:55:18,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 318 transitions. [2020-10-26 03:55:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-26 03:55:18,070 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:18,070 INFO L422 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] [2020-10-26 03:55:18,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 03:55:18,071 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:18,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:18,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1297795486, now seen corresponding path program 1 times [2020-10-26 03:55:18,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:18,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016946675] [2020-10-26 03:55:18,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:18,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:18,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016946675] [2020-10-26 03:55:18,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:18,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:18,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142408593] [2020-10-26 03:55:18,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:18,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:18,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:18,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:18,138 INFO L87 Difference]: Start difference. First operand 184 states and 318 transitions. Second operand 4 states. [2020-10-26 03:55:18,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:18,286 INFO L93 Difference]: Finished difference Result 257 states and 441 transitions. [2020-10-26 03:55:18,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:18,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-26 03:55:18,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:18,289 INFO L225 Difference]: With dead ends: 257 [2020-10-26 03:55:18,289 INFO L226 Difference]: Without dead ends: 257 [2020-10-26 03:55:18,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:18,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-10-26 03:55:18,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2020-10-26 03:55:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-10-26 03:55:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 440 transitions. [2020-10-26 03:55:18,299 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 440 transitions. Word has length 24 [2020-10-26 03:55:18,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:18,300 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 440 transitions. [2020-10-26 03:55:18,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 440 transitions. [2020-10-26 03:55:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-26 03:55:18,302 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:18,302 INFO L422 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] [2020-10-26 03:55:18,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 03:55:18,302 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:18,303 INFO L82 PathProgramCache]: Analyzing trace with hash -290462118, now seen corresponding path program 1 times [2020-10-26 03:55:18,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:18,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310348040] [2020-10-26 03:55:18,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:18,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:18,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310348040] [2020-10-26 03:55:18,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:18,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:18,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666184240] [2020-10-26 03:55:18,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:18,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:18,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:18,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:18,357 INFO L87 Difference]: Start difference. First operand 256 states and 440 transitions. Second operand 4 states. [2020-10-26 03:55:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:18,496 INFO L93 Difference]: Finished difference Result 263 states and 445 transitions. [2020-10-26 03:55:18,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:18,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-26 03:55:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:18,499 INFO L225 Difference]: With dead ends: 263 [2020-10-26 03:55:18,499 INFO L226 Difference]: Without dead ends: 263 [2020-10-26 03:55:18,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-10-26 03:55:18,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2020-10-26 03:55:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-10-26 03:55:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 444 transitions. [2020-10-26 03:55:18,507 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 444 transitions. Word has length 25 [2020-10-26 03:55:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:18,507 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 444 transitions. [2020-10-26 03:55:18,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 444 transitions. [2020-10-26 03:55:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-26 03:55:18,509 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:18,509 INFO L422 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] [2020-10-26 03:55:18,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 03:55:18,510 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:18,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:18,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1570325796, now seen corresponding path program 1 times [2020-10-26 03:55:18,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:18,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792993456] [2020-10-26 03:55:18,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:18,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:18,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792993456] [2020-10-26 03:55:18,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:18,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:18,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125168647] [2020-10-26 03:55:18,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:18,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:18,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:18,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:18,563 INFO L87 Difference]: Start difference. First operand 262 states and 444 transitions. Second operand 4 states. [2020-10-26 03:55:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:18,755 INFO L93 Difference]: Finished difference Result 475 states and 813 transitions. [2020-10-26 03:55:18,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:18,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-26 03:55:18,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:18,760 INFO L225 Difference]: With dead ends: 475 [2020-10-26 03:55:18,760 INFO L226 Difference]: Without dead ends: 475 [2020-10-26 03:55:18,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:18,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2020-10-26 03:55:18,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 362. [2020-10-26 03:55:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-10-26 03:55:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 604 transitions. [2020-10-26 03:55:18,773 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 604 transitions. Word has length 25 [2020-10-26 03:55:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:18,774 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 604 transitions. [2020-10-26 03:55:18,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 604 transitions. [2020-10-26 03:55:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-26 03:55:18,777 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:18,777 INFO L422 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] [2020-10-26 03:55:18,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 03:55:18,777 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:18,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:18,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1713524250, now seen corresponding path program 1 times [2020-10-26 03:55:18,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:18,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357186905] [2020-10-26 03:55:18,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:18,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:18,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357186905] [2020-10-26 03:55:18,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:18,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:18,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783321672] [2020-10-26 03:55:18,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:18,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:18,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:18,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:18,843 INFO L87 Difference]: Start difference. First operand 362 states and 604 transitions. Second operand 4 states. [2020-10-26 03:55:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:19,036 INFO L93 Difference]: Finished difference Result 499 states and 825 transitions. [2020-10-26 03:55:19,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:19,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-26 03:55:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:19,040 INFO L225 Difference]: With dead ends: 499 [2020-10-26 03:55:19,040 INFO L226 Difference]: Without dead ends: 499 [2020-10-26 03:55:19,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2020-10-26 03:55:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 498. [2020-10-26 03:55:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2020-10-26 03:55:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 824 transitions. [2020-10-26 03:55:19,054 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 824 transitions. Word has length 25 [2020-10-26 03:55:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:19,054 INFO L481 AbstractCegarLoop]: Abstraction has 498 states and 824 transitions. [2020-10-26 03:55:19,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 824 transitions. [2020-10-26 03:55:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-26 03:55:19,056 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:19,056 INFO L422 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] [2020-10-26 03:55:19,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 03:55:19,057 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:19,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:19,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1428820243, now seen corresponding path program 1 times [2020-10-26 03:55:19,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:19,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756034006] [2020-10-26 03:55:19,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:19,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:19,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756034006] [2020-10-26 03:55:19,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:19,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:19,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143956645] [2020-10-26 03:55:19,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:19,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:19,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:19,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:19,113 INFO L87 Difference]: Start difference. First operand 498 states and 824 transitions. Second operand 4 states. [2020-10-26 03:55:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:19,303 INFO L93 Difference]: Finished difference Result 507 states and 825 transitions. [2020-10-26 03:55:19,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:19,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-26 03:55:19,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:19,306 INFO L225 Difference]: With dead ends: 507 [2020-10-26 03:55:19,306 INFO L226 Difference]: Without dead ends: 507 [2020-10-26 03:55:19,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2020-10-26 03:55:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 506. [2020-10-26 03:55:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-10-26 03:55:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 824 transitions. [2020-10-26 03:55:19,321 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 824 transitions. Word has length 26 [2020-10-26 03:55:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:19,321 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 824 transitions. [2020-10-26 03:55:19,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 824 transitions. [2020-10-26 03:55:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-26 03:55:19,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:19,322 INFO L422 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] [2020-10-26 03:55:19,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-26 03:55:19,323 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:19,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:19,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1586283375, now seen corresponding path program 1 times [2020-10-26 03:55:19,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:19,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651139939] [2020-10-26 03:55:19,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:19,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:19,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651139939] [2020-10-26 03:55:19,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:19,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:19,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548887162] [2020-10-26 03:55:19,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:19,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:19,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:19,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:19,377 INFO L87 Difference]: Start difference. First operand 506 states and 824 transitions. Second operand 4 states. [2020-10-26 03:55:19,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:19,542 INFO L93 Difference]: Finished difference Result 907 states and 1489 transitions. [2020-10-26 03:55:19,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:19,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-26 03:55:19,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:19,548 INFO L225 Difference]: With dead ends: 907 [2020-10-26 03:55:19,548 INFO L226 Difference]: Without dead ends: 907 [2020-10-26 03:55:19,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2020-10-26 03:55:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 714. [2020-10-26 03:55:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2020-10-26 03:55:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1136 transitions. [2020-10-26 03:55:19,569 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1136 transitions. Word has length 26 [2020-10-26 03:55:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:19,570 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 1136 transitions. [2020-10-26 03:55:19,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1136 transitions. [2020-10-26 03:55:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-26 03:55:19,571 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:19,571 INFO L422 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] [2020-10-26 03:55:19,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-26 03:55:19,572 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:19,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:19,572 INFO L82 PathProgramCache]: Analyzing trace with hash 575166125, now seen corresponding path program 1 times [2020-10-26 03:55:19,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:19,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073252043] [2020-10-26 03:55:19,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:19,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:19,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073252043] [2020-10-26 03:55:19,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:19,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:19,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648598452] [2020-10-26 03:55:19,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:19,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:19,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:19,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:19,634 INFO L87 Difference]: Start difference. First operand 714 states and 1136 transitions. Second operand 4 states. [2020-10-26 03:55:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:19,804 INFO L93 Difference]: Finished difference Result 971 states and 1529 transitions. [2020-10-26 03:55:19,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:19,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-26 03:55:19,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:19,811 INFO L225 Difference]: With dead ends: 971 [2020-10-26 03:55:19,811 INFO L226 Difference]: Without dead ends: 971 [2020-10-26 03:55:19,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2020-10-26 03:55:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 970. [2020-10-26 03:55:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2020-10-26 03:55:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1528 transitions. [2020-10-26 03:55:19,843 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1528 transitions. Word has length 26 [2020-10-26 03:55:19,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:19,843 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 1528 transitions. [2020-10-26 03:55:19,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1528 transitions. [2020-10-26 03:55:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-26 03:55:19,845 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:19,845 INFO L422 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] [2020-10-26 03:55:19,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-26 03:55:19,846 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:19,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:19,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1936794117, now seen corresponding path program 1 times [2020-10-26 03:55:19,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:19,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980182441] [2020-10-26 03:55:19,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:19,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:19,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980182441] [2020-10-26 03:55:19,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:19,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:19,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444940329] [2020-10-26 03:55:19,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:19,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:19,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:19,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:19,919 INFO L87 Difference]: Start difference. First operand 970 states and 1528 transitions. Second operand 4 states. [2020-10-26 03:55:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:20,099 INFO L93 Difference]: Finished difference Result 987 states and 1529 transitions. [2020-10-26 03:55:20,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:20,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-26 03:55:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:20,104 INFO L225 Difference]: With dead ends: 987 [2020-10-26 03:55:20,105 INFO L226 Difference]: Without dead ends: 987 [2020-10-26 03:55:20,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:20,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2020-10-26 03:55:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 986. [2020-10-26 03:55:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2020-10-26 03:55:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1528 transitions. [2020-10-26 03:55:20,127 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1528 transitions. Word has length 27 [2020-10-26 03:55:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:20,127 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 1528 transitions. [2020-10-26 03:55:20,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1528 transitions. [2020-10-26 03:55:20,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-26 03:55:20,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:20,129 INFO L422 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] [2020-10-26 03:55:20,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-26 03:55:20,129 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:20,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:20,130 INFO L82 PathProgramCache]: Analyzing trace with hash 656930439, now seen corresponding path program 1 times [2020-10-26 03:55:20,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:20,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063563942] [2020-10-26 03:55:20,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:20,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:20,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063563942] [2020-10-26 03:55:20,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:20,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:20,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283862537] [2020-10-26 03:55:20,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:20,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:20,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:20,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:20,184 INFO L87 Difference]: Start difference. First operand 986 states and 1528 transitions. Second operand 4 states. [2020-10-26 03:55:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:20,362 INFO L93 Difference]: Finished difference Result 1739 states and 2713 transitions. [2020-10-26 03:55:20,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:20,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-26 03:55:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:20,372 INFO L225 Difference]: With dead ends: 1739 [2020-10-26 03:55:20,372 INFO L226 Difference]: Without dead ends: 1739 [2020-10-26 03:55:20,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:20,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2020-10-26 03:55:20,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1418. [2020-10-26 03:55:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2020-10-26 03:55:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2136 transitions. [2020-10-26 03:55:20,407 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2136 transitions. Word has length 27 [2020-10-26 03:55:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:20,407 INFO L481 AbstractCegarLoop]: Abstraction has 1418 states and 2136 transitions. [2020-10-26 03:55:20,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:20,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2136 transitions. [2020-10-26 03:55:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-26 03:55:20,410 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:20,410 INFO L422 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] [2020-10-26 03:55:20,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-26 03:55:20,411 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:20,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:20,411 INFO L82 PathProgramCache]: Analyzing trace with hash -354186811, now seen corresponding path program 1 times [2020-10-26 03:55:20,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:20,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601842191] [2020-10-26 03:55:20,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:20,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:20,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601842191] [2020-10-26 03:55:20,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:20,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:20,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059129276] [2020-10-26 03:55:20,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:20,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:20,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:20,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:20,464 INFO L87 Difference]: Start difference. First operand 1418 states and 2136 transitions. Second operand 4 states. [2020-10-26 03:55:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:20,619 INFO L93 Difference]: Finished difference Result 1899 states and 2825 transitions. [2020-10-26 03:55:20,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:20,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-26 03:55:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:20,629 INFO L225 Difference]: With dead ends: 1899 [2020-10-26 03:55:20,629 INFO L226 Difference]: Without dead ends: 1899 [2020-10-26 03:55:20,630 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2020-10-26 03:55:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1898. [2020-10-26 03:55:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-10-26 03:55:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2824 transitions. [2020-10-26 03:55:20,682 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2824 transitions. Word has length 27 [2020-10-26 03:55:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:20,683 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 2824 transitions. [2020-10-26 03:55:20,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2824 transitions. [2020-10-26 03:55:20,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-26 03:55:20,686 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:20,686 INFO L422 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] [2020-10-26 03:55:20,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-26 03:55:20,686 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:20,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1103332552, now seen corresponding path program 1 times [2020-10-26 03:55:20,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:20,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384657819] [2020-10-26 03:55:20,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:20,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:20,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384657819] [2020-10-26 03:55:20,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:20,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:20,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45640826] [2020-10-26 03:55:20,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:20,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:20,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:20,745 INFO L87 Difference]: Start difference. First operand 1898 states and 2824 transitions. Second operand 4 states. [2020-10-26 03:55:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:20,914 INFO L93 Difference]: Finished difference Result 1931 states and 2825 transitions. [2020-10-26 03:55:20,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:20,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-10-26 03:55:20,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:20,923 INFO L225 Difference]: With dead ends: 1931 [2020-10-26 03:55:20,924 INFO L226 Difference]: Without dead ends: 1931 [2020-10-26 03:55:20,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2020-10-26 03:55:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1930. [2020-10-26 03:55:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states. [2020-10-26 03:55:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2824 transitions. [2020-10-26 03:55:20,969 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2824 transitions. Word has length 28 [2020-10-26 03:55:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:20,970 INFO L481 AbstractCegarLoop]: Abstraction has 1930 states and 2824 transitions. [2020-10-26 03:55:20,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2824 transitions. [2020-10-26 03:55:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-26 03:55:20,972 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:20,973 INFO L422 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] [2020-10-26 03:55:20,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-26 03:55:20,973 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:20,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:20,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1911771066, now seen corresponding path program 1 times [2020-10-26 03:55:20,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:20,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038546688] [2020-10-26 03:55:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:21,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:21,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038546688] [2020-10-26 03:55:21,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:21,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:21,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071470857] [2020-10-26 03:55:21,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:21,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:21,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:21,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:21,047 INFO L87 Difference]: Start difference. First operand 1930 states and 2824 transitions. Second operand 4 states. [2020-10-26 03:55:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:21,214 INFO L93 Difference]: Finished difference Result 3339 states and 4905 transitions. [2020-10-26 03:55:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:21,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-10-26 03:55:21,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:21,231 INFO L225 Difference]: With dead ends: 3339 [2020-10-26 03:55:21,231 INFO L226 Difference]: Without dead ends: 3339 [2020-10-26 03:55:21,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2020-10-26 03:55:21,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2826. [2020-10-26 03:55:21,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2826 states. [2020-10-26 03:55:21,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 4008 transitions. [2020-10-26 03:55:21,303 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 4008 transitions. Word has length 28 [2020-10-26 03:55:21,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:21,304 INFO L481 AbstractCegarLoop]: Abstraction has 2826 states and 4008 transitions. [2020-10-26 03:55:21,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 4008 transitions. [2020-10-26 03:55:21,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-26 03:55:21,309 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:21,309 INFO L422 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] [2020-10-26 03:55:21,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-26 03:55:21,309 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:21,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:21,310 INFO L82 PathProgramCache]: Analyzing trace with hash 900653816, now seen corresponding path program 1 times [2020-10-26 03:55:21,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:21,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006790923] [2020-10-26 03:55:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:21,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:21,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006790923] [2020-10-26 03:55:21,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:21,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:21,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894172711] [2020-10-26 03:55:21,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:21,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:21,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:21,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:21,376 INFO L87 Difference]: Start difference. First operand 2826 states and 4008 transitions. Second operand 4 states. [2020-10-26 03:55:21,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:21,545 INFO L93 Difference]: Finished difference Result 3723 states and 5193 transitions. [2020-10-26 03:55:21,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:21,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-10-26 03:55:21,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:21,562 INFO L225 Difference]: With dead ends: 3723 [2020-10-26 03:55:21,562 INFO L226 Difference]: Without dead ends: 3723 [2020-10-26 03:55:21,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:21,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2020-10-26 03:55:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3722. [2020-10-26 03:55:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3722 states. [2020-10-26 03:55:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 5192 transitions. [2020-10-26 03:55:21,647 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 5192 transitions. Word has length 28 [2020-10-26 03:55:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:21,648 INFO L481 AbstractCegarLoop]: Abstraction has 3722 states and 5192 transitions. [2020-10-26 03:55:21,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5192 transitions. [2020-10-26 03:55:21,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-26 03:55:21,653 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:21,653 INFO L422 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] [2020-10-26 03:55:21,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-26 03:55:21,654 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:21,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:21,654 INFO L82 PathProgramCache]: Analyzing trace with hash -857968208, now seen corresponding path program 1 times [2020-10-26 03:55:21,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:21,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621388539] [2020-10-26 03:55:21,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:21,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:21,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621388539] [2020-10-26 03:55:21,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:21,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:21,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843445779] [2020-10-26 03:55:21,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:21,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:21,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:21,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:21,703 INFO L87 Difference]: Start difference. First operand 3722 states and 5192 transitions. Second operand 4 states. [2020-10-26 03:55:21,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:21,859 INFO L93 Difference]: Finished difference Result 3787 states and 5193 transitions. [2020-10-26 03:55:21,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:21,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-10-26 03:55:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:21,876 INFO L225 Difference]: With dead ends: 3787 [2020-10-26 03:55:21,876 INFO L226 Difference]: Without dead ends: 3787 [2020-10-26 03:55:21,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:21,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2020-10-26 03:55:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3786. [2020-10-26 03:55:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3786 states. [2020-10-26 03:55:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3786 states and 5192 transitions. [2020-10-26 03:55:21,958 INFO L78 Accepts]: Start accepts. Automaton has 3786 states and 5192 transitions. Word has length 29 [2020-10-26 03:55:21,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:21,959 INFO L481 AbstractCegarLoop]: Abstraction has 3786 states and 5192 transitions. [2020-10-26 03:55:21,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5192 transitions. [2020-10-26 03:55:21,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-26 03:55:21,964 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:21,964 INFO L422 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] [2020-10-26 03:55:21,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-26 03:55:21,964 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:21,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:21,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2137831886, now seen corresponding path program 1 times [2020-10-26 03:55:21,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:21,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42294184] [2020-10-26 03:55:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:22,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:22,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42294184] [2020-10-26 03:55:22,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:22,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:22,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87434681] [2020-10-26 03:55:22,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:22,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:22,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:22,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:22,015 INFO L87 Difference]: Start difference. First operand 3786 states and 5192 transitions. Second operand 4 states. [2020-10-26 03:55:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:22,184 INFO L93 Difference]: Finished difference Result 6411 states and 8777 transitions. [2020-10-26 03:55:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:22,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-10-26 03:55:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:22,214 INFO L225 Difference]: With dead ends: 6411 [2020-10-26 03:55:22,215 INFO L226 Difference]: Without dead ends: 6411 [2020-10-26 03:55:22,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2020-10-26 03:55:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5642. [2020-10-26 03:55:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2020-10-26 03:55:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 7496 transitions. [2020-10-26 03:55:22,334 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 7496 transitions. Word has length 29 [2020-10-26 03:55:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:22,334 INFO L481 AbstractCegarLoop]: Abstraction has 5642 states and 7496 transitions. [2020-10-26 03:55:22,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 7496 transitions. [2020-10-26 03:55:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-26 03:55:22,344 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:22,344 INFO L422 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] [2020-10-26 03:55:22,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-26 03:55:22,345 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:22,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:22,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1146018160, now seen corresponding path program 1 times [2020-10-26 03:55:22,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:22,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112164804] [2020-10-26 03:55:22,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:22,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:22,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112164804] [2020-10-26 03:55:22,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:22,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:22,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249783442] [2020-10-26 03:55:22,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:22,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:22,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:22,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:22,420 INFO L87 Difference]: Start difference. First operand 5642 states and 7496 transitions. Second operand 4 states. [2020-10-26 03:55:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:22,582 INFO L93 Difference]: Finished difference Result 7307 states and 9481 transitions. [2020-10-26 03:55:22,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:22,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-10-26 03:55:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:22,600 INFO L225 Difference]: With dead ends: 7307 [2020-10-26 03:55:22,600 INFO L226 Difference]: Without dead ends: 7307 [2020-10-26 03:55:22,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:22,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2020-10-26 03:55:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7306. [2020-10-26 03:55:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7306 states. [2020-10-26 03:55:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7306 states to 7306 states and 9480 transitions. [2020-10-26 03:55:22,761 INFO L78 Accepts]: Start accepts. Automaton has 7306 states and 9480 transitions. Word has length 29 [2020-10-26 03:55:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:22,761 INFO L481 AbstractCegarLoop]: Abstraction has 7306 states and 9480 transitions. [2020-10-26 03:55:22,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 9480 transitions. [2020-10-26 03:55:22,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-26 03:55:22,773 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:22,773 INFO L422 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] [2020-10-26 03:55:22,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-26 03:55:22,773 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:22,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:22,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1841597565, now seen corresponding path program 1 times [2020-10-26 03:55:22,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:22,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185016462] [2020-10-26 03:55:22,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:22,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:22,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185016462] [2020-10-26 03:55:22,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:22,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:22,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680357809] [2020-10-26 03:55:22,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:22,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:22,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:22,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:22,831 INFO L87 Difference]: Start difference. First operand 7306 states and 9480 transitions. Second operand 4 states. [2020-10-26 03:55:23,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:23,018 INFO L93 Difference]: Finished difference Result 7435 states and 9481 transitions. [2020-10-26 03:55:23,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:23,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-10-26 03:55:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:23,035 INFO L225 Difference]: With dead ends: 7435 [2020-10-26 03:55:23,036 INFO L226 Difference]: Without dead ends: 7435 [2020-10-26 03:55:23,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2020-10-26 03:55:23,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7434. [2020-10-26 03:55:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7434 states. [2020-10-26 03:55:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7434 states to 7434 states and 9480 transitions. [2020-10-26 03:55:23,208 INFO L78 Accepts]: Start accepts. Automaton has 7434 states and 9480 transitions. Word has length 30 [2020-10-26 03:55:23,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:23,209 INFO L481 AbstractCegarLoop]: Abstraction has 7434 states and 9480 transitions. [2020-10-26 03:55:23,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7434 states and 9480 transitions. [2020-10-26 03:55:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-26 03:55:23,218 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:23,218 INFO L422 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] [2020-10-26 03:55:23,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-26 03:55:23,219 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:23,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:23,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1173506053, now seen corresponding path program 1 times [2020-10-26 03:55:23,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:23,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283379289] [2020-10-26 03:55:23,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:23,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:23,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:23,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283379289] [2020-10-26 03:55:23,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:23,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:23,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452820457] [2020-10-26 03:55:23,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:23,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:23,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:23,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:23,270 INFO L87 Difference]: Start difference. First operand 7434 states and 9480 transitions. Second operand 4 states. [2020-10-26 03:55:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:23,430 INFO L93 Difference]: Finished difference Result 12299 states and 15497 transitions. [2020-10-26 03:55:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:23,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-10-26 03:55:23,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:23,457 INFO L225 Difference]: With dead ends: 12299 [2020-10-26 03:55:23,457 INFO L226 Difference]: Without dead ends: 12299 [2020-10-26 03:55:23,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2020-10-26 03:55:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 11274. [2020-10-26 03:55:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11274 states. [2020-10-26 03:55:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11274 states to 11274 states and 13960 transitions. [2020-10-26 03:55:23,770 INFO L78 Accepts]: Start accepts. Automaton has 11274 states and 13960 transitions. Word has length 30 [2020-10-26 03:55:23,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:23,770 INFO L481 AbstractCegarLoop]: Abstraction has 11274 states and 13960 transitions. [2020-10-26 03:55:23,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:23,770 INFO L276 IsEmpty]: Start isEmpty. Operand 11274 states and 13960 transitions. [2020-10-26 03:55:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-26 03:55:23,794 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:23,795 INFO L422 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] [2020-10-26 03:55:23,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-26 03:55:23,795 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:23,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:23,796 INFO L82 PathProgramCache]: Analyzing trace with hash 162388803, now seen corresponding path program 1 times [2020-10-26 03:55:23,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:23,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470742648] [2020-10-26 03:55:23,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:23,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:23,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470742648] [2020-10-26 03:55:23,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:23,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:23,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914955844] [2020-10-26 03:55:23,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:23,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:23,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:23,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:23,849 INFO L87 Difference]: Start difference. First operand 11274 states and 13960 transitions. Second operand 4 states. [2020-10-26 03:55:24,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:24,023 INFO L93 Difference]: Finished difference Result 14347 states and 17161 transitions. [2020-10-26 03:55:24,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:24,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-10-26 03:55:24,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:24,056 INFO L225 Difference]: With dead ends: 14347 [2020-10-26 03:55:24,056 INFO L226 Difference]: Without dead ends: 14347 [2020-10-26 03:55:24,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2020-10-26 03:55:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 14346. [2020-10-26 03:55:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14346 states. [2020-10-26 03:55:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14346 states to 14346 states and 17160 transitions. [2020-10-26 03:55:24,417 INFO L78 Accepts]: Start accepts. Automaton has 14346 states and 17160 transitions. Word has length 30 [2020-10-26 03:55:24,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:24,418 INFO L481 AbstractCegarLoop]: Abstraction has 14346 states and 17160 transitions. [2020-10-26 03:55:24,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 14346 states and 17160 transitions. [2020-10-26 03:55:24,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-26 03:55:24,440 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:24,440 INFO L422 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] [2020-10-26 03:55:24,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-26 03:55:24,441 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:24,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:24,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2025641307, now seen corresponding path program 1 times [2020-10-26 03:55:24,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:24,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087212997] [2020-10-26 03:55:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:24,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:24,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087212997] [2020-10-26 03:55:24,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:24,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:24,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500866564] [2020-10-26 03:55:24,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:24,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:24,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:24,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:24,499 INFO L87 Difference]: Start difference. First operand 14346 states and 17160 transitions. Second operand 4 states. [2020-10-26 03:55:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:24,758 INFO L93 Difference]: Finished difference Result 14603 states and 17161 transitions. [2020-10-26 03:55:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:24,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-10-26 03:55:24,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:24,790 INFO L225 Difference]: With dead ends: 14603 [2020-10-26 03:55:24,790 INFO L226 Difference]: Without dead ends: 14603 [2020-10-26 03:55:24,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2020-10-26 03:55:24,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 14602. [2020-10-26 03:55:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14602 states. [2020-10-26 03:55:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14602 states to 14602 states and 17160 transitions. [2020-10-26 03:55:25,027 INFO L78 Accepts]: Start accepts. Automaton has 14602 states and 17160 transitions. Word has length 31 [2020-10-26 03:55:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:25,027 INFO L481 AbstractCegarLoop]: Abstraction has 14602 states and 17160 transitions. [2020-10-26 03:55:25,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 14602 states and 17160 transitions. [2020-10-26 03:55:25,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-26 03:55:25,048 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:25,048 INFO L422 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] [2020-10-26 03:55:25,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-26 03:55:25,048 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:25,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:25,049 INFO L82 PathProgramCache]: Analyzing trace with hash 745777629, now seen corresponding path program 1 times [2020-10-26 03:55:25,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:25,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355985771] [2020-10-26 03:55:25,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:25,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:25,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355985771] [2020-10-26 03:55:25,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:25,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:25,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087586547] [2020-10-26 03:55:25,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:25,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:25,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:25,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:25,104 INFO L87 Difference]: Start difference. First operand 14602 states and 17160 transitions. Second operand 4 states. [2020-10-26 03:55:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:25,441 INFO L93 Difference]: Finished difference Result 28170 states and 31240 transitions. [2020-10-26 03:55:25,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:25,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-10-26 03:55:25,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:25,473 INFO L225 Difference]: With dead ends: 28170 [2020-10-26 03:55:25,474 INFO L226 Difference]: Without dead ends: 14602 [2020-10-26 03:55:25,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:25,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2020-10-26 03:55:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14602. [2020-10-26 03:55:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14602 states. [2020-10-26 03:55:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14602 states to 14602 states and 16136 transitions. [2020-10-26 03:55:25,717 INFO L78 Accepts]: Start accepts. Automaton has 14602 states and 16136 transitions. Word has length 31 [2020-10-26 03:55:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:25,717 INFO L481 AbstractCegarLoop]: Abstraction has 14602 states and 16136 transitions. [2020-10-26 03:55:25,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 14602 states and 16136 transitions. [2020-10-26 03:55:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-26 03:55:25,736 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:25,737 INFO L422 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] [2020-10-26 03:55:25,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-26 03:55:25,737 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:25,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:25,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1756894879, now seen corresponding path program 1 times [2020-10-26 03:55:25,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:25,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199536064] [2020-10-26 03:55:25,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:25,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:55:25,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199536064] [2020-10-26 03:55:25,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:25,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:25,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624456682] [2020-10-26 03:55:25,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:25,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:25,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:25,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:25,787 INFO L87 Difference]: Start difference. First operand 14602 states and 16136 transitions. Second operand 4 states. [2020-10-26 03:55:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:25,888 INFO L93 Difference]: Finished difference Result 14599 states and 15622 transitions. [2020-10-26 03:55:25,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:25,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-10-26 03:55:25,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:25,889 INFO L225 Difference]: With dead ends: 14599 [2020-10-26 03:55:25,890 INFO L226 Difference]: Without dead ends: 0 [2020-10-26 03:55:25,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:55:25,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-26 03:55:25,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-26 03:55:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-26 03:55:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-26 03:55:25,891 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-10-26 03:55:25,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:25,891 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 03:55:25,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-26 03:55:25,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-26 03:55:25,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-26 03:55:25,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 03:55:25 BoogieIcfgContainer [2020-10-26 03:55:25,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 03:55:25,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 03:55:25,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 03:55:25,898 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 03:55:25,943 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:55:15" (3/4) ... [2020-10-26 03:55:25,948 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-26 03:55:25,955 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2020-10-26 03:55:25,955 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-10-26 03:55:25,956 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-10-26 03:55:25,967 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-10-26 03:55:25,968 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-26 03:55:25,968 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-26 03:55:25,968 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-26 03:55:26,039 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 03:55:26,040 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 03:55:26,042 INFO L168 Benchmark]: Toolchain (without parser) took 11451.16 ms. Allocated memory was 39.8 MB in the beginning and 413.1 MB in the end (delta: 373.3 MB). Free memory was 16.8 MB in the beginning and 293.4 MB in the end (delta: -276.6 MB). Peak memory consumption was 265.7 MB. Max. memory is 16.1 GB. [2020-10-26 03:55:26,042 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 39.8 MB. Free memory is still 18.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 03:55:26,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.62 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.2 MB in the beginning and 23.5 MB in the end (delta: -7.2 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. [2020-10-26 03:55:26,043 INFO L168 Benchmark]: Boogie Preprocessor took 50.99 ms. Allocated memory is still 48.2 MB. Free memory was 23.5 MB in the beginning and 21.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 03:55:26,043 INFO L168 Benchmark]: RCFGBuilder took 579.26 ms. Allocated memory is still 48.2 MB. Free memory was 21.8 MB in the beginning and 24.9 MB in the end (delta: -3.2 MB). Peak memory consumption was 5.9 MB. Max. memory is 16.1 GB. [2020-10-26 03:55:26,044 INFO L168 Benchmark]: TraceAbstraction took 10266.07 ms. Allocated memory was 48.2 MB in the beginning and 413.1 MB in the end (delta: 364.9 MB). Free memory was 24.5 MB in the beginning and 129.0 MB in the end (delta: -104.5 MB). Peak memory consumption was 260.5 MB. Max. memory is 16.1 GB. [2020-10-26 03:55:26,044 INFO L168 Benchmark]: Witness Printer took 141.60 ms. Allocated memory is still 413.1 MB. Free memory was 129.0 MB in the beginning and 293.4 MB in the end (delta: -164.5 MB). Peak memory consumption was 2.2 MB. Max. memory is 16.1 GB. [2020-10-26 03:55:26,046 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 39.8 MB. Free memory is still 18.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 394.62 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.2 MB in the beginning and 23.5 MB in the end (delta: -7.2 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 50.99 ms. Allocated memory is still 48.2 MB. Free memory was 23.5 MB in the beginning and 21.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 579.26 ms. Allocated memory is still 48.2 MB. Free memory was 21.8 MB in the beginning and 24.9 MB in the end (delta: -3.2 MB). Peak memory consumption was 5.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10266.07 ms. Allocated memory was 48.2 MB in the beginning and 413.1 MB in the end (delta: 364.9 MB). Free memory was 24.5 MB in the beginning and 129.0 MB in the end (delta: -104.5 MB). Peak memory consumption was 260.5 MB. Max. memory is 16.1 GB. * Witness Printer took 141.60 ms. Allocated memory is still 413.1 MB. Free memory was 129.0 MB in the beginning and 293.4 MB in the end (delta: -164.5 MB). Peak memory consumption was 2.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.1s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2450 SDtfs, 3578 SDslu, 216 SDs, 0 SdLazy, 1705 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14602occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 3074 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 758 NumberOfCodeBlocks, 758 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 729 ConstructedInterpolants, 0 QuantifiedInterpolants, 57759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...