./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_8.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_8.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 37d0ed05d77a0379c9ed98058bf2f327252773ce ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:53,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 03:55:53,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 03:55:53,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 03:55:53,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 03:55:53,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 03:55:53,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 03:55:53,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 03:55:53,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 03:55:53,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 03:55:53,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 03:55:53,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 03:55:53,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 03:55:53,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 03:55:53,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 03:55:53,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 03:55:53,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 03:55:53,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 03:55:53,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 03:55:53,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 03:55:53,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 03:55:53,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 03:55:53,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 03:55:53,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 03:55:53,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 03:55:53,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 03:55:53,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 03:55:53,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 03:55:53,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 03:55:53,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 03:55:53,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 03:55:53,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 03:55:53,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 03:55:53,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 03:55:53,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 03:55:53,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 03:55:53,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 03:55:53,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 03:55:53,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 03:55:53,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 03:55:53,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 03:55:53,213 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:53,241 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 03:55:53,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 03:55:53,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 03:55:53,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 03:55:53,244 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 03:55:53,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 03:55:53,245 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 03:55:53,245 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 03:55:53,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 03:55:53,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 03:55:53,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 03:55:53,246 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-26 03:55:53,247 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-26 03:55:53,247 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-26 03:55:53,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 03:55:53,247 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-26 03:55:53,248 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 03:55:53,248 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 03:55:53,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 03:55:53,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 03:55:53,249 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 03:55:53,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 03:55:53,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 03:55:53,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 03:55:53,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 03:55:53,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 03:55:53,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 03:55:53,251 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 03:55:53,251 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 -> 37d0ed05d77a0379c9ed98058bf2f327252773ce [2020-10-26 03:55:53,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 03:55:53,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 03:55:53,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 03:55:53,730 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 03:55:53,731 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 03:55:53,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2020-10-26 03:55:53,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de57ca3a8/d2f4ac33ce134b54ad1475d3b2f1526c/FLAG241b2b9b4 [2020-10-26 03:55:54,398 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 03:55:54,399 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2020-10-26 03:55:54,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de57ca3a8/d2f4ac33ce134b54ad1475d3b2f1526c/FLAG241b2b9b4 [2020-10-26 03:55:54,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de57ca3a8/d2f4ac33ce134b54ad1475d3b2f1526c [2020-10-26 03:55:54,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 03:55:54,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-26 03:55:54,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 03:55:54,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 03:55:54,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 03:55:54,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:55:54" (1/1) ... [2020-10-26 03:55:54,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba2461d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:54, skipping insertion in model container [2020-10-26 03:55:54,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:55:54" (1/1) ... [2020-10-26 03:55:54,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 03:55:54,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 03:55:55,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 03:55:55,084 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 03:55:55,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 03:55:55,133 INFO L208 MainTranslator]: Completed translation [2020-10-26 03:55:55,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:55 WrapperNode [2020-10-26 03:55:55,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 03:55:55,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 03:55:55,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 03:55:55,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 03:55:55,150 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:55" (1/1) ... [2020-10-26 03:55:55,151 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:55" (1/1) ... [2020-10-26 03:55:55,160 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:55" (1/1) ... [2020-10-26 03:55:55,161 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:55" (1/1) ... [2020-10-26 03:55:55,169 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:55" (1/1) ... [2020-10-26 03:55:55,179 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:55" (1/1) ... [2020-10-26 03:55:55,186 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:55" (1/1) ... [2020-10-26 03:55:55,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 03:55:55,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 03:55:55,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 03:55:55,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 03:55:55,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:55" (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:55,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-26 03:55:55,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 03:55:55,291 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-26 03:55:55,291 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-26 03:55:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-26 03:55:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-26 03:55:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-26 03:55:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 03:55:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-26 03:55:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-26 03:55:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-26 03:55:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 03:55:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 03:55:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 03:55:55,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 03:55:55,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 03:55:55,777 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 03:55:55,777 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-26 03:55:55,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:55:55 BoogieIcfgContainer [2020-10-26 03:55:55,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 03:55:55,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 03:55:55,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 03:55:55,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 03:55:55,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 03:55:54" (1/3) ... [2020-10-26 03:55:55,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462b67d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:55:55, skipping insertion in model container [2020-10-26 03:55:55,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:55:55" (2/3) ... [2020-10-26 03:55:55,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462b67d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:55:55, skipping insertion in model container [2020-10-26 03:55:55,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:55:55" (3/3) ... [2020-10-26 03:55:55,793 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-10-26 03:55:55,816 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 03:55:55,821 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-26 03:55:55,838 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-26 03:55:55,880 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 03:55:55,880 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-26 03:55:55,881 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 03:55:55,881 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 03:55:55,881 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 03:55:55,881 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 03:55:55,881 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 03:55:55,889 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 03:55:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-10-26 03:55:55,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-26 03:55:55,930 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:55,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:55:55,932 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:55,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:55,946 INFO L82 PathProgramCache]: Analyzing trace with hash -533984572, now seen corresponding path program 1 times [2020-10-26 03:55:55,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:55,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018575597] [2020-10-26 03:55:55,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:56,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:56,276 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:56,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018575597] [2020-10-26 03:55:56,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:56,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 03:55:56,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71541254] [2020-10-26 03:55:56,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 03:55:56,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:56,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 03:55:56,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 03:55:56,304 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-10-26 03:55:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:56,374 INFO L93 Difference]: Finished difference Result 40 states and 63 transitions. [2020-10-26 03:55:56,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 03:55:56,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-26 03:55:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:56,389 INFO L225 Difference]: With dead ends: 40 [2020-10-26 03:55:56,389 INFO L226 Difference]: Without dead ends: 35 [2020-10-26 03:55:56,391 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:56,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-26 03:55:56,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-26 03:55:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-26 03:55:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2020-10-26 03:55:56,438 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 9 [2020-10-26 03:55:56,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:56,438 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2020-10-26 03:55:56,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 03:55:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2020-10-26 03:55:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-26 03:55:56,440 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:56,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] [2020-10-26 03:55:56,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 03:55:56,441 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:56,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:56,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1669689353, now seen corresponding path program 1 times [2020-10-26 03:55:56,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:56,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636835353] [2020-10-26 03:55:56,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:56,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:56,628 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:56,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636835353] [2020-10-26 03:55:56,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:56,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:56,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291155601] [2020-10-26 03:55:56,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:56,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:56,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:56,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:56,634 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand 4 states. [2020-10-26 03:55:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:56,854 INFO L93 Difference]: Finished difference Result 61 states and 106 transitions. [2020-10-26 03:55:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:56,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-26 03:55:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:56,857 INFO L225 Difference]: With dead ends: 61 [2020-10-26 03:55:56,857 INFO L226 Difference]: Without dead ends: 61 [2020-10-26 03:55:56,858 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:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-26 03:55:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2020-10-26 03:55:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-26 03:55:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 75 transitions. [2020-10-26 03:55:56,869 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 75 transitions. Word has length 20 [2020-10-26 03:55:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:56,870 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 75 transitions. [2020-10-26 03:55:56,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 75 transitions. [2020-10-26 03:55:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-26 03:55:56,871 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:56,871 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] [2020-10-26 03:55:56,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 03:55:56,872 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:56,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:56,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1411523915, now seen corresponding path program 1 times [2020-10-26 03:55:56,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:56,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35386418] [2020-10-26 03:55:56,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:56,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:57,005 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:57,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35386418] [2020-10-26 03:55:57,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:57,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:57,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572594079] [2020-10-26 03:55:57,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:57,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:57,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:57,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:57,009 INFO L87 Difference]: Start difference. First operand 44 states and 75 transitions. Second operand 4 states. [2020-10-26 03:55:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:57,373 INFO L93 Difference]: Finished difference Result 61 states and 104 transitions. [2020-10-26 03:55:57,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:57,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-26 03:55:57,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:57,377 INFO L225 Difference]: With dead ends: 61 [2020-10-26 03:55:57,377 INFO L226 Difference]: Without dead ends: 61 [2020-10-26 03:55:57,378 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:57,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-26 03:55:57,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2020-10-26 03:55:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-26 03:55:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 103 transitions. [2020-10-26 03:55:57,400 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 103 transitions. Word has length 20 [2020-10-26 03:55:57,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:57,402 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 103 transitions. [2020-10-26 03:55:57,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:57,402 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2020-10-26 03:55:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-26 03:55:57,405 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:57,405 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] [2020-10-26 03:55:57,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 03:55:57,408 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:57,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:57,409 INFO L82 PathProgramCache]: Analyzing trace with hash -214134839, now seen corresponding path program 1 times [2020-10-26 03:55:57,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:57,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973807] [2020-10-26 03:55:57,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:57,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:57,544 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:57,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973807] [2020-10-26 03:55:57,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:57,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:57,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125497243] [2020-10-26 03:55:57,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:57,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:57,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:57,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:57,552 INFO L87 Difference]: Start difference. First operand 60 states and 103 transitions. Second operand 4 states. [2020-10-26 03:55:57,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:57,726 INFO L93 Difference]: Finished difference Result 64 states and 106 transitions. [2020-10-26 03:55:57,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:57,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-26 03:55:57,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:57,728 INFO L225 Difference]: With dead ends: 64 [2020-10-26 03:55:57,729 INFO L226 Difference]: Without dead ends: 64 [2020-10-26 03:55:57,729 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:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-26 03:55:57,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2020-10-26 03:55:57,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-26 03:55:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 105 transitions. [2020-10-26 03:55:57,739 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 105 transitions. Word has length 21 [2020-10-26 03:55:57,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:57,739 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 105 transitions. [2020-10-26 03:55:57,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 105 transitions. [2020-10-26 03:55:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-26 03:55:57,741 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:57,741 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] [2020-10-26 03:55:57,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 03:55:57,742 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:57,742 INFO L82 PathProgramCache]: Analyzing trace with hash -800940853, now seen corresponding path program 1 times [2020-10-26 03:55:57,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:57,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929821971] [2020-10-26 03:55:57,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:57,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:57,821 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:57,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929821971] [2020-10-26 03:55:57,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:57,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:57,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783101215] [2020-10-26 03:55:57,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:57,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:57,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:57,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:57,825 INFO L87 Difference]: Start difference. First operand 63 states and 105 transitions. Second operand 4 states. [2020-10-26 03:55:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:57,992 INFO L93 Difference]: Finished difference Result 113 states and 191 transitions. [2020-10-26 03:55:57,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:57,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-26 03:55:57,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:57,995 INFO L225 Difference]: With dead ends: 113 [2020-10-26 03:55:57,995 INFO L226 Difference]: Without dead ends: 113 [2020-10-26 03:55:57,995 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:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-26 03:55:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2020-10-26 03:55:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-26 03:55:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 190 transitions. [2020-10-26 03:55:58,007 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 190 transitions. Word has length 21 [2020-10-26 03:55:58,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:58,008 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 190 transitions. [2020-10-26 03:55:58,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 190 transitions. [2020-10-26 03:55:58,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-26 03:55:58,009 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:58,009 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] [2020-10-26 03:55:58,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 03:55:58,010 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:58,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:58,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1059106291, now seen corresponding path program 1 times [2020-10-26 03:55:58,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:58,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149549784] [2020-10-26 03:55:58,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:58,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:58,087 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:58,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149549784] [2020-10-26 03:55:58,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:58,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:58,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298615421] [2020-10-26 03:55:58,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:58,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:58,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:58,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:58,090 INFO L87 Difference]: Start difference. First operand 112 states and 190 transitions. Second operand 4 states. [2020-10-26 03:55:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:58,234 INFO L93 Difference]: Finished difference Result 141 states and 241 transitions. [2020-10-26 03:55:58,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:58,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-26 03:55:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:58,236 INFO L225 Difference]: With dead ends: 141 [2020-10-26 03:55:58,236 INFO L226 Difference]: Without dead ends: 141 [2020-10-26 03:55:58,236 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:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-10-26 03:55:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2020-10-26 03:55:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-26 03:55:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 188 transitions. [2020-10-26 03:55:58,247 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 188 transitions. Word has length 21 [2020-10-26 03:55:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:58,247 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 188 transitions. [2020-10-26 03:55:58,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 188 transitions. [2020-10-26 03:55:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 03:55:58,248 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:58,249 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:58,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 03:55:58,249 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:58,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:58,250 INFO L82 PathProgramCache]: Analyzing trace with hash 947275456, now seen corresponding path program 1 times [2020-10-26 03:55:58,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:58,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105676453] [2020-10-26 03:55:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:58,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:58,312 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:58,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105676453] [2020-10-26 03:55:58,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:58,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:58,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631747608] [2020-10-26 03:55:58,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:58,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:58,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:58,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:58,315 INFO L87 Difference]: Start difference. First operand 112 states and 188 transitions. Second operand 4 states. [2020-10-26 03:55:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:58,475 INFO L93 Difference]: Finished difference Result 201 states and 343 transitions. [2020-10-26 03:55:58,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:58,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-26 03:55:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:58,478 INFO L225 Difference]: With dead ends: 201 [2020-10-26 03:55:58,479 INFO L226 Difference]: Without dead ends: 201 [2020-10-26 03:55:58,479 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:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-26 03:55:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 152. [2020-10-26 03:55:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-26 03:55:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 254 transitions. [2020-10-26 03:55:58,507 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 254 transitions. Word has length 22 [2020-10-26 03:55:58,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:58,507 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 254 transitions. [2020-10-26 03:55:58,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 254 transitions. [2020-10-26 03:55:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 03:55:58,511 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:58,512 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:58,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 03:55:58,512 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:58,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:58,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1205440894, now seen corresponding path program 1 times [2020-10-26 03:55:58,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:58,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080989190] [2020-10-26 03:55:58,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:58,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:58,610 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:58,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080989190] [2020-10-26 03:55:58,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:58,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:58,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274240753] [2020-10-26 03:55:58,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:58,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:58,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:58,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:58,613 INFO L87 Difference]: Start difference. First operand 152 states and 254 transitions. Second operand 4 states. [2020-10-26 03:55:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:58,775 INFO L93 Difference]: Finished difference Result 209 states and 345 transitions. [2020-10-26 03:55:58,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:58,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-26 03:55:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:58,777 INFO L225 Difference]: With dead ends: 209 [2020-10-26 03:55:58,777 INFO L226 Difference]: Without dead ends: 209 [2020-10-26 03:55:58,777 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:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-26 03:55:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2020-10-26 03:55:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-10-26 03:55:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 344 transitions. [2020-10-26 03:55:58,788 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 344 transitions. Word has length 22 [2020-10-26 03:55:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:58,788 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 344 transitions. [2020-10-26 03:55:58,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 344 transitions. [2020-10-26 03:55:58,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-26 03:55:58,790 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:58,790 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:58,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 03:55:58,791 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:58,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:58,791 INFO L82 PathProgramCache]: Analyzing trace with hash -692583242, now seen corresponding path program 1 times [2020-10-26 03:55:58,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:58,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686119856] [2020-10-26 03:55:58,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:58,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:58,888 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:58,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686119856] [2020-10-26 03:55:58,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:58,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:58,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18832399] [2020-10-26 03:55:58,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:58,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:58,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:58,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:58,892 INFO L87 Difference]: Start difference. First operand 208 states and 344 transitions. Second operand 4 states. [2020-10-26 03:55:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:59,039 INFO L93 Difference]: Finished difference Result 215 states and 349 transitions. [2020-10-26 03:55:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:59,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-26 03:55:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:59,042 INFO L225 Difference]: With dead ends: 215 [2020-10-26 03:55:59,042 INFO L226 Difference]: Without dead ends: 215 [2020-10-26 03:55:59,046 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:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-10-26 03:55:59,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2020-10-26 03:55:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-26 03:55:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 348 transitions. [2020-10-26 03:55:59,055 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 348 transitions. Word has length 23 [2020-10-26 03:55:59,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:59,055 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 348 transitions. [2020-10-26 03:55:59,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 348 transitions. [2020-10-26 03:55:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-26 03:55:59,058 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:59,058 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:59,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 03:55:59,058 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:59,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1279389256, now seen corresponding path program 1 times [2020-10-26 03:55:59,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:59,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221376071] [2020-10-26 03:55:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:59,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:59,122 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:59,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221376071] [2020-10-26 03:55:59,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:59,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:59,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660521065] [2020-10-26 03:55:59,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:59,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:59,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:59,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:59,125 INFO L87 Difference]: Start difference. First operand 214 states and 348 transitions. Second operand 4 states. [2020-10-26 03:55:59,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:59,297 INFO L93 Difference]: Finished difference Result 379 states and 621 transitions. [2020-10-26 03:55:59,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:59,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-26 03:55:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:59,304 INFO L225 Difference]: With dead ends: 379 [2020-10-26 03:55:59,304 INFO L226 Difference]: Without dead ends: 379 [2020-10-26 03:55:59,305 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:59,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-10-26 03:55:59,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 298. [2020-10-26 03:55:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-10-26 03:55:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 476 transitions. [2020-10-26 03:55:59,317 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 476 transitions. Word has length 23 [2020-10-26 03:55:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:59,318 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 476 transitions. [2020-10-26 03:55:59,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 476 transitions. [2020-10-26 03:55:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-26 03:55:59,327 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:59,327 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:59,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 03:55:59,328 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:59,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:59,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1021223818, now seen corresponding path program 1 times [2020-10-26 03:55:59,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:59,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430933650] [2020-10-26 03:55:59,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:59,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:59,415 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:59,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430933650] [2020-10-26 03:55:59,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:59,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:59,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450094379] [2020-10-26 03:55:59,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:59,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:59,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:59,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:59,420 INFO L87 Difference]: Start difference. First operand 298 states and 476 transitions. Second operand 4 states. [2020-10-26 03:55:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:59,599 INFO L93 Difference]: Finished difference Result 403 states and 633 transitions. [2020-10-26 03:55:59,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:59,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-26 03:55:59,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:59,603 INFO L225 Difference]: With dead ends: 403 [2020-10-26 03:55:59,603 INFO L226 Difference]: Without dead ends: 403 [2020-10-26 03:55:59,603 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:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2020-10-26 03:55:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 402. [2020-10-26 03:55:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-10-26 03:55:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 632 transitions. [2020-10-26 03:55:59,614 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 632 transitions. Word has length 23 [2020-10-26 03:55:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:59,615 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 632 transitions. [2020-10-26 03:55:59,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 632 transitions. [2020-10-26 03:55:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-26 03:55:59,616 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:59,616 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:59,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 03:55:59,616 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:59,617 INFO L82 PathProgramCache]: Analyzing trace with hash -999702007, now seen corresponding path program 1 times [2020-10-26 03:55:59,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:59,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287385114] [2020-10-26 03:55:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:59,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:59,682 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:59,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287385114] [2020-10-26 03:55:59,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:59,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:59,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498250928] [2020-10-26 03:55:59,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:59,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:59,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:59,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:59,685 INFO L87 Difference]: Start difference. First operand 402 states and 632 transitions. Second operand 4 states. [2020-10-26 03:55:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:55:59,890 INFO L93 Difference]: Finished difference Result 411 states and 633 transitions. [2020-10-26 03:55:59,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:55:59,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-26 03:55:59,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:55:59,895 INFO L225 Difference]: With dead ends: 411 [2020-10-26 03:55:59,895 INFO L226 Difference]: Without dead ends: 411 [2020-10-26 03:55:59,896 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:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-10-26 03:55:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 410. [2020-10-26 03:55:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-10-26 03:55:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 632 transitions. [2020-10-26 03:55:59,908 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 632 transitions. Word has length 24 [2020-10-26 03:55:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:55:59,908 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 632 transitions. [2020-10-26 03:55:59,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:55:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 632 transitions. [2020-10-26 03:55:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-26 03:55:59,910 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:55:59,910 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:59,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-26 03:55:59,910 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:55:59,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:55:59,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1586508021, now seen corresponding path program 1 times [2020-10-26 03:55:59,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:55:59,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493256046] [2020-10-26 03:55:59,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:55:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:59,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:55:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:55:59,966 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:59,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493256046] [2020-10-26 03:55:59,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:55:59,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:55:59,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939354351] [2020-10-26 03:55:59,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:55:59,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:55:59,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:55:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:55:59,969 INFO L87 Difference]: Start difference. First operand 410 states and 632 transitions. Second operand 4 states. [2020-10-26 03:56:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:00,117 INFO L93 Difference]: Finished difference Result 715 states and 1105 transitions. [2020-10-26 03:56:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:00,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-26 03:56:00,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:00,122 INFO L225 Difference]: With dead ends: 715 [2020-10-26 03:56:00,122 INFO L226 Difference]: Without dead ends: 715 [2020-10-26 03:56:00,123 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:56:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2020-10-26 03:56:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 586. [2020-10-26 03:56:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2020-10-26 03:56:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 880 transitions. [2020-10-26 03:56:00,141 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 880 transitions. Word has length 24 [2020-10-26 03:56:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:00,141 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 880 transitions. [2020-10-26 03:56:00,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 880 transitions. [2020-10-26 03:56:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-26 03:56:00,143 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:00,144 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:56:00,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-26 03:56:00,144 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:56:00,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1328342583, now seen corresponding path program 1 times [2020-10-26 03:56:00,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:00,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949083040] [2020-10-26 03:56:00,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:00,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:00,199 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:56:00,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949083040] [2020-10-26 03:56:00,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:00,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:56:00,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094490225] [2020-10-26 03:56:00,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:56:00,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:00,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:56:00,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:00,202 INFO L87 Difference]: Start difference. First operand 586 states and 880 transitions. Second operand 4 states. [2020-10-26 03:56:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:00,374 INFO L93 Difference]: Finished difference Result 779 states and 1145 transitions. [2020-10-26 03:56:00,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:00,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-26 03:56:00,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:00,380 INFO L225 Difference]: With dead ends: 779 [2020-10-26 03:56:00,381 INFO L226 Difference]: Without dead ends: 779 [2020-10-26 03:56:00,382 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:56:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2020-10-26 03:56:00,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 778. [2020-10-26 03:56:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-10-26 03:56:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1144 transitions. [2020-10-26 03:56:00,404 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1144 transitions. Word has length 24 [2020-10-26 03:56:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:00,405 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 1144 transitions. [2020-10-26 03:56:00,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1144 transitions. [2020-10-26 03:56:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-26 03:56:00,407 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:00,407 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:56:00,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-26 03:56:00,407 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:56:00,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:00,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1930438559, now seen corresponding path program 1 times [2020-10-26 03:56:00,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:00,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372231482] [2020-10-26 03:56:00,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:00,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:00,480 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:56:00,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372231482] [2020-10-26 03:56:00,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:00,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:56:00,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457448153] [2020-10-26 03:56:00,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:56:00,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:00,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:56:00,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:00,485 INFO L87 Difference]: Start difference. First operand 778 states and 1144 transitions. Second operand 4 states. [2020-10-26 03:56:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:00,633 INFO L93 Difference]: Finished difference Result 795 states and 1145 transitions. [2020-10-26 03:56:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:00,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-26 03:56:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:00,638 INFO L225 Difference]: With dead ends: 795 [2020-10-26 03:56:00,639 INFO L226 Difference]: Without dead ends: 795 [2020-10-26 03:56:00,642 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:56:00,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2020-10-26 03:56:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 794. [2020-10-26 03:56:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-10-26 03:56:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1144 transitions. [2020-10-26 03:56:00,675 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1144 transitions. Word has length 25 [2020-10-26 03:56:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:00,675 INFO L481 AbstractCegarLoop]: Abstraction has 794 states and 1144 transitions. [2020-10-26 03:56:00,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1144 transitions. [2020-10-26 03:56:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-26 03:56:00,678 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:00,678 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:56:00,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-26 03:56:00,679 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:56:00,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:00,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1777722723, now seen corresponding path program 1 times [2020-10-26 03:56:00,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:00,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707410212] [2020-10-26 03:56:00,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:00,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:00,755 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:56:00,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707410212] [2020-10-26 03:56:00,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:00,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:56:00,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580337728] [2020-10-26 03:56:00,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:56:00,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:00,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:56:00,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:00,762 INFO L87 Difference]: Start difference. First operand 794 states and 1144 transitions. Second operand 4 states. [2020-10-26 03:56:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:00,908 INFO L93 Difference]: Finished difference Result 1355 states and 1945 transitions. [2020-10-26 03:56:00,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:00,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-26 03:56:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:00,916 INFO L225 Difference]: With dead ends: 1355 [2020-10-26 03:56:00,916 INFO L226 Difference]: Without dead ends: 1355 [2020-10-26 03:56:00,917 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:56:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-10-26 03:56:00,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1162. [2020-10-26 03:56:00,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2020-10-26 03:56:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1624 transitions. [2020-10-26 03:56:00,947 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1624 transitions. Word has length 25 [2020-10-26 03:56:00,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:00,947 INFO L481 AbstractCegarLoop]: Abstraction has 1162 states and 1624 transitions. [2020-10-26 03:56:00,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:00,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1624 transitions. [2020-10-26 03:56:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-26 03:56:00,950 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:00,951 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:56:00,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-26 03:56:00,951 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:56:00,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:00,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2035888161, now seen corresponding path program 1 times [2020-10-26 03:56:00,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:00,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648598452] [2020-10-26 03:56:00,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:01,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:01,033 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:56:01,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648598452] [2020-10-26 03:56:01,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:01,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:56:01,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466315993] [2020-10-26 03:56:01,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:56:01,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:01,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:56:01,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:01,040 INFO L87 Difference]: Start difference. First operand 1162 states and 1624 transitions. Second operand 4 states. [2020-10-26 03:56:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:01,200 INFO L93 Difference]: Finished difference Result 1515 states and 2057 transitions. [2020-10-26 03:56:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:01,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-26 03:56:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:01,209 INFO L225 Difference]: With dead ends: 1515 [2020-10-26 03:56:01,209 INFO L226 Difference]: Without dead ends: 1515 [2020-10-26 03:56:01,210 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:56:01,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2020-10-26 03:56:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1514. [2020-10-26 03:56:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1514 states. [2020-10-26 03:56:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2056 transitions. [2020-10-26 03:56:01,261 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2056 transitions. Word has length 25 [2020-10-26 03:56:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:01,262 INFO L481 AbstractCegarLoop]: Abstraction has 1514 states and 2056 transitions. [2020-10-26 03:56:01,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:01,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2056 transitions. [2020-10-26 03:56:01,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-26 03:56:01,266 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:01,266 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:56:01,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-26 03:56:01,267 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:56:01,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:01,268 INFO L82 PathProgramCache]: Analyzing trace with hash -718490028, now seen corresponding path program 1 times [2020-10-26 03:56:01,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:01,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620566105] [2020-10-26 03:56:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:01,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:01,338 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:56:01,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620566105] [2020-10-26 03:56:01,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:01,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:56:01,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151742644] [2020-10-26 03:56:01,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:56:01,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:01,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:56:01,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:01,350 INFO L87 Difference]: Start difference. First operand 1514 states and 2056 transitions. Second operand 4 states. [2020-10-26 03:56:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:01,500 INFO L93 Difference]: Finished difference Result 1547 states and 2057 transitions. [2020-10-26 03:56:01,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:01,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-26 03:56:01,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:01,509 INFO L225 Difference]: With dead ends: 1547 [2020-10-26 03:56:01,509 INFO L226 Difference]: Without dead ends: 1547 [2020-10-26 03:56:01,510 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:56:01,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2020-10-26 03:56:01,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1546. [2020-10-26 03:56:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2020-10-26 03:56:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2056 transitions. [2020-10-26 03:56:01,563 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2056 transitions. Word has length 26 [2020-10-26 03:56:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:01,563 INFO L481 AbstractCegarLoop]: Abstraction has 1546 states and 2056 transitions. [2020-10-26 03:56:01,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2056 transitions. [2020-10-26 03:56:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-26 03:56:01,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:01,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, 1, 1, 1] [2020-10-26 03:56:01,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-26 03:56:01,567 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:56:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:01,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1305296042, now seen corresponding path program 1 times [2020-10-26 03:56:01,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:01,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566518359] [2020-10-26 03:56:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:01,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:01,646 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:56:01,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566518359] [2020-10-26 03:56:01,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:01,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:56:01,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897960225] [2020-10-26 03:56:01,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:56:01,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:01,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:56:01,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:01,652 INFO L87 Difference]: Start difference. First operand 1546 states and 2056 transitions. Second operand 4 states. [2020-10-26 03:56:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:01,806 INFO L93 Difference]: Finished difference Result 2571 states and 3369 transitions. [2020-10-26 03:56:01,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:01,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-26 03:56:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:01,819 INFO L225 Difference]: With dead ends: 2571 [2020-10-26 03:56:01,820 INFO L226 Difference]: Without dead ends: 2571 [2020-10-26 03:56:01,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:56:01,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2020-10-26 03:56:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2314. [2020-10-26 03:56:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2314 states. [2020-10-26 03:56:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 2984 transitions. [2020-10-26 03:56:01,883 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 2984 transitions. Word has length 26 [2020-10-26 03:56:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:01,883 INFO L481 AbstractCegarLoop]: Abstraction has 2314 states and 2984 transitions. [2020-10-26 03:56:01,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 2984 transitions. [2020-10-26 03:56:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-26 03:56:01,888 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:01,889 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:56:01,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-26 03:56:01,889 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:56:01,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:01,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1047130604, now seen corresponding path program 1 times [2020-10-26 03:56:01,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:01,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884364600] [2020-10-26 03:56:01,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:01,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:01,979 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:56:01,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884364600] [2020-10-26 03:56:01,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:01,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:56:01,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032919992] [2020-10-26 03:56:01,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:56:01,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:01,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:56:01,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:01,982 INFO L87 Difference]: Start difference. First operand 2314 states and 2984 transitions. Second operand 4 states. [2020-10-26 03:56:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:02,140 INFO L93 Difference]: Finished difference Result 2955 states and 3657 transitions. [2020-10-26 03:56:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:02,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-26 03:56:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:02,156 INFO L225 Difference]: With dead ends: 2955 [2020-10-26 03:56:02,156 INFO L226 Difference]: Without dead ends: 2955 [2020-10-26 03:56:02,156 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:56:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-10-26 03:56:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2954. [2020-10-26 03:56:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2020-10-26 03:56:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3656 transitions. [2020-10-26 03:56:02,251 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3656 transitions. Word has length 26 [2020-10-26 03:56:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:02,252 INFO L481 AbstractCegarLoop]: Abstraction has 2954 states and 3656 transitions. [2020-10-26 03:56:02,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:02,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3656 transitions. [2020-10-26 03:56:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-26 03:56:02,258 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:02,258 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:56:02,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-26 03:56:02,260 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:56:02,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:02,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1802780660, now seen corresponding path program 1 times [2020-10-26 03:56:02,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:02,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152579169] [2020-10-26 03:56:02,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:02,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:02,328 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:56:02,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152579169] [2020-10-26 03:56:02,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:02,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:56:02,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473368940] [2020-10-26 03:56:02,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:56:02,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:02,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:56:02,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:02,333 INFO L87 Difference]: Start difference. First operand 2954 states and 3656 transitions. Second operand 4 states. [2020-10-26 03:56:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:02,507 INFO L93 Difference]: Finished difference Result 3019 states and 3657 transitions. [2020-10-26 03:56:02,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:02,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-26 03:56:02,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:02,526 INFO L225 Difference]: With dead ends: 3019 [2020-10-26 03:56:02,527 INFO L226 Difference]: Without dead ends: 3019 [2020-10-26 03:56:02,527 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:56:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2020-10-26 03:56:02,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3018. [2020-10-26 03:56:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-10-26 03:56:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 3656 transitions. [2020-10-26 03:56:02,615 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 3656 transitions. Word has length 27 [2020-10-26 03:56:02,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:02,615 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 3656 transitions. [2020-10-26 03:56:02,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:02,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3656 transitions. [2020-10-26 03:56:02,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-26 03:56:02,620 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:02,621 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:56:02,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-26 03:56:02,621 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:56:02,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:02,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1905380622, now seen corresponding path program 1 times [2020-10-26 03:56:02,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:02,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194798850] [2020-10-26 03:56:02,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:02,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:02,684 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:56:02,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194798850] [2020-10-26 03:56:02,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:02,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:56:02,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268467949] [2020-10-26 03:56:02,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:56:02,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:02,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:56:02,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:02,692 INFO L87 Difference]: Start difference. First operand 3018 states and 3656 transitions. Second operand 4 states. [2020-10-26 03:56:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:02,870 INFO L93 Difference]: Finished difference Result 4874 states and 5704 transitions. [2020-10-26 03:56:02,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:02,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-26 03:56:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:02,894 INFO L225 Difference]: With dead ends: 4874 [2020-10-26 03:56:02,894 INFO L226 Difference]: Without dead ends: 4874 [2020-10-26 03:56:02,896 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:56:02,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2020-10-26 03:56:03,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4618. [2020-10-26 03:56:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4618 states. [2020-10-26 03:56:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4618 states to 4618 states and 5448 transitions. [2020-10-26 03:56:03,023 INFO L78 Accepts]: Start accepts. Automaton has 4618 states and 5448 transitions. Word has length 27 [2020-10-26 03:56:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:03,023 INFO L481 AbstractCegarLoop]: Abstraction has 4618 states and 5448 transitions. [2020-10-26 03:56:03,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4618 states and 5448 transitions. [2020-10-26 03:56:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-26 03:56:03,032 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:03,032 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:56:03,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-26 03:56:03,033 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-26 03:56:03,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:03,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2131421236, now seen corresponding path program 1 times [2020-10-26 03:56:03,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:03,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523424781] [2020-10-26 03:56:03,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:03,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:03,096 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:56:03,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523424781] [2020-10-26 03:56:03,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:03,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:56:03,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422131236] [2020-10-26 03:56:03,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:56:03,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:03,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:56:03,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:03,107 INFO L87 Difference]: Start difference. First operand 4618 states and 5448 transitions. Second operand 4 states. [2020-10-26 03:56:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:03,263 INFO L93 Difference]: Finished difference Result 5767 states and 6406 transitions. [2020-10-26 03:56:03,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:03,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-26 03:56:03,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:03,264 INFO L225 Difference]: With dead ends: 5767 [2020-10-26 03:56:03,264 INFO L226 Difference]: Without dead ends: 0 [2020-10-26 03:56:03,265 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:56:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-26 03:56:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-26 03:56:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-26 03:56:03,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-26 03:56:03,266 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2020-10-26 03:56:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:03,267 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 03:56:03,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-26 03:56:03,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-26 03:56:03,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-26 03:56:03,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 03:56:03 BoogieIcfgContainer [2020-10-26 03:56:03,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 03:56:03,274 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 03:56:03,275 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 03:56:03,275 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 03:56:03,276 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:55" (3/4) ... [2020-10-26 03:56:03,280 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-26 03:56:03,287 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2020-10-26 03:56:03,288 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-10-26 03:56:03,288 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-10-26 03:56:03,322 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-10-26 03:56:03,323 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-26 03:56:03,323 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-26 03:56:03,324 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-26 03:56:03,398 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 03:56:03,398 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 03:56:03,401 INFO L168 Benchmark]: Toolchain (without parser) took 8635.82 ms. Allocated memory was 56.6 MB in the beginning and 153.1 MB in the end (delta: 96.5 MB). Free memory was 33.9 MB in the beginning and 126.0 MB in the end (delta: -92.0 MB). Peak memory consumption was 88.9 MB. Max. memory is 16.1 GB. [2020-10-26 03:56:03,402 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 44.0 MB. Free memory was 22.1 MB in the beginning and 22.0 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 03:56:03,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.84 ms. Allocated memory is still 56.6 MB. Free memory was 33.3 MB in the beginning and 36.4 MB in the end (delta: -3.2 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. [2020-10-26 03:56:03,404 INFO L168 Benchmark]: Boogie Preprocessor took 56.80 ms. Allocated memory is still 56.6 MB. Free memory was 36.4 MB in the beginning and 34.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:56:03,404 INFO L168 Benchmark]: RCFGBuilder took 586.01 ms. Allocated memory is still 56.6 MB. Free memory was 34.8 MB in the beginning and 29.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. [2020-10-26 03:56:03,405 INFO L168 Benchmark]: TraceAbstraction took 7492.66 ms. Allocated memory was 56.6 MB in the beginning and 153.1 MB in the end (delta: 96.5 MB). Free memory was 29.3 MB in the beginning and 46.8 MB in the end (delta: -17.5 MB). Peak memory consumption was 77.9 MB. Max. memory is 16.1 GB. [2020-10-26 03:56:03,405 INFO L168 Benchmark]: Witness Printer took 124.13 ms. Allocated memory is still 153.1 MB. Free memory was 46.8 MB in the beginning and 126.0 MB in the end (delta: -79.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 03:56:03,407 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.61 ms. Allocated memory is still 44.0 MB. Free memory was 22.1 MB in the beginning and 22.0 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 359.84 ms. Allocated memory is still 56.6 MB. Free memory was 33.3 MB in the beginning and 36.4 MB in the end (delta: -3.2 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 56.80 ms. Allocated memory is still 56.6 MB. Free memory was 36.4 MB in the beginning and 34.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 586.01 ms. Allocated memory is still 56.6 MB. Free memory was 34.8 MB in the beginning and 29.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7492.66 ms. Allocated memory was 56.6 MB in the beginning and 153.1 MB in the end (delta: 96.5 MB). Free memory was 29.3 MB in the beginning and 46.8 MB in the end (delta: -17.5 MB). Peak memory consumption was 77.9 MB. Max. memory is 16.1 GB. * Witness Printer took 124.13 ms. Allocated memory is still 153.1 MB. Free memory was 46.8 MB in the beginning and 126.0 MB in the end (delta: -79.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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, 44 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1616 SDtfs, 2261 SDslu, 170 SDs, 0 SdLazy, 1123 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4618occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 1024 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 531 NumberOfCodeBlocks, 531 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 36258 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...