./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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_6.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 fc492c809d432e4c3053fa8c39191c1c15ea4eea ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:46:23,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:46:23,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:46:23,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:46:23,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:46:23,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:46:23,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:46:23,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:46:23,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:46:23,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:46:23,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:46:23,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:46:23,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:46:23,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:46:23,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:46:23,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:46:23,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:46:23,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:46:23,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:46:23,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:46:23,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:46:23,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:46:23,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:46:23,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:46:23,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:46:23,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:46:23,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:46:23,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:46:23,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:46:23,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:46:23,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:46:23,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:46:23,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:46:23,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:46:23,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:46:23,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:46:23,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:46:23,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:46:23,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:46:23,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:46:23,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:46:23,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 02:46:23,133 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:46:23,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:46:23,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:46:23,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:46:23,137 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:46:23,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:46:23,137 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:46:23,138 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:46:23,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:46:23,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:46:23,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:46:23,139 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:46:23,139 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:46:23,139 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:46:23,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:46:23,139 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:46:23,141 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:46:23,141 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:46:23,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:46:23,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:46:23,142 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:46:23,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:46:23,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:23,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:46:23,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:46:23,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:46:23,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:46:23,143 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2019-11-28 02:46:23,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:46:23,497 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:46:23,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:46:23,502 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:46:23,502 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:46:23,503 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2019-11-28 02:46:23,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f744ae513/8b72b9d94ba5414eab421b676db8a673/FLAG5e9ce7ecf [2019-11-28 02:46:23,994 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:46:23,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2019-11-28 02:46:24,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f744ae513/8b72b9d94ba5414eab421b676db8a673/FLAG5e9ce7ecf [2019-11-28 02:46:24,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f744ae513/8b72b9d94ba5414eab421b676db8a673 [2019-11-28 02:46:24,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:46:24,393 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:46:24,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:24,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:46:24,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:46:24,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:24" (1/1) ... [2019-11-28 02:46:24,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52957880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:24, skipping insertion in model container [2019-11-28 02:46:24,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:24" (1/1) ... [2019-11-28 02:46:24,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:46:24,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:46:24,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:24,614 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:46:24,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:24,649 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:46:24,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:24 WrapperNode [2019-11-28 02:46:24,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:24,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:46:24,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:46:24,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:46:24,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:24" (1/1) ... [2019-11-28 02:46:24,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:24" (1/1) ... [2019-11-28 02:46:24,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:24" (1/1) ... [2019-11-28 02:46:24,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:24" (1/1) ... [2019-11-28 02:46:24,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:24" (1/1) ... [2019-11-28 02:46:24,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:24" (1/1) ... [2019-11-28 02:46:24,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:24" (1/1) ... [2019-11-28 02:46:24,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:46:24,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:46:24,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:46:24,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:46:24,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:24" (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 [2019-11-28 02:46:24,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:46:24,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:46:24,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:46:24,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:46:24,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:46:24,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:46:24,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:46:24,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:46:25,098 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:46:25,099 INFO L297 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 02:46:25,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:25 BoogieIcfgContainer [2019-11-28 02:46:25,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:46:25,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:46:25,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:46:25,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:46:25,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:46:24" (1/3) ... [2019-11-28 02:46:25,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30644907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:25, skipping insertion in model container [2019-11-28 02:46:25,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:24" (2/3) ... [2019-11-28 02:46:25,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30644907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:25, skipping insertion in model container [2019-11-28 02:46:25,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:25" (3/3) ... [2019-11-28 02:46:25,109 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-11-28 02:46:25,116 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:46:25,121 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 02:46:25,130 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 02:46:25,147 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:46:25,147 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:46:25,147 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:46:25,148 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:46:25,148 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:46:25,148 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:46:25,148 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:46:25,148 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:46:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-28 02:46:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:46:25,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,176 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,183 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2019-11-28 02:46:25,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819039867] [2019-11-28 02:46:25,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819039867] [2019-11-28 02:46:25,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744833071] [2019-11-28 02:46:25,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,394 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-11-28 02:46:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,467 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2019-11-28 02:46:25,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 02:46:25,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,486 INFO L225 Difference]: With dead ends: 56 [2019-11-28 02:46:25,487 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 02:46:25,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 02:46:25,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-11-28 02:46:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 02:46:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-11-28 02:46:25,530 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2019-11-28 02:46:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,531 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-11-28 02:46:25,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-11-28 02:46:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:46:25,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,534 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2019-11-28 02:46:25,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823203312] [2019-11-28 02:46:25,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823203312] [2019-11-28 02:46:25,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385002817] [2019-11-28 02:46:25,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,593 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2019-11-28 02:46:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,631 INFO L93 Difference]: Finished difference Result 48 states and 78 transitions. [2019-11-28 02:46:25,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 02:46:25,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,633 INFO L225 Difference]: With dead ends: 48 [2019-11-28 02:46:25,633 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 02:46:25,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 02:46:25,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-11-28 02:46:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 02:46:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2019-11-28 02:46:25,642 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2019-11-28 02:46:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,643 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2019-11-28 02:46:25,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2019-11-28 02:46:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:46:25,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,644 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,644 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,645 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2019-11-28 02:46:25,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594932866] [2019-11-28 02:46:25,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594932866] [2019-11-28 02:46:25,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192769199] [2019-11-28 02:46:25,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,688 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2019-11-28 02:46:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,706 INFO L93 Difference]: Finished difference Result 51 states and 80 transitions. [2019-11-28 02:46:25,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 02:46:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,708 INFO L225 Difference]: With dead ends: 51 [2019-11-28 02:46:25,709 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 02:46:25,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 02:46:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-11-28 02:46:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 02:46:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-11-28 02:46:25,716 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2019-11-28 02:46:25,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,717 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-11-28 02:46:25,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-11-28 02:46:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:46:25,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,720 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,720 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2019-11-28 02:46:25,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548264481] [2019-11-28 02:46:25,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548264481] [2019-11-28 02:46:25,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791616508] [2019-11-28 02:46:25,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,792 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2019-11-28 02:46:25,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,822 INFO L93 Difference]: Finished difference Result 86 states and 141 transitions. [2019-11-28 02:46:25,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 02:46:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,828 INFO L225 Difference]: With dead ends: 86 [2019-11-28 02:46:25,828 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 02:46:25,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 02:46:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2019-11-28 02:46:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 02:46:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2019-11-28 02:46:25,843 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2019-11-28 02:46:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,844 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2019-11-28 02:46:25,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2019-11-28 02:46:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:46:25,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,845 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2019-11-28 02:46:25,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471408187] [2019-11-28 02:46:25,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471408187] [2019-11-28 02:46:25,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208896649] [2019-11-28 02:46:25,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,918 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2019-11-28 02:46:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,936 INFO L93 Difference]: Finished difference Result 88 states and 139 transitions. [2019-11-28 02:46:25,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 02:46:25,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,938 INFO L225 Difference]: With dead ends: 88 [2019-11-28 02:46:25,938 INFO L226 Difference]: Without dead ends: 88 [2019-11-28 02:46:25,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-28 02:46:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-11-28 02:46:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 02:46:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2019-11-28 02:46:25,949 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2019-11-28 02:46:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,950 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2019-11-28 02:46:25,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2019-11-28 02:46:25,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:46:25,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,952 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2019-11-28 02:46:25,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970658382] [2019-11-28 02:46:25,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970658382] [2019-11-28 02:46:25,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826646710] [2019-11-28 02:46:25,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,995 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2019-11-28 02:46:26,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,019 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2019-11-28 02:46:26,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 02:46:26,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,021 INFO L225 Difference]: With dead ends: 90 [2019-11-28 02:46:26,021 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 02:46:26,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 02:46:26,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-11-28 02:46:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 02:46:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-11-28 02:46:26,030 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2019-11-28 02:46:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,030 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-11-28 02:46:26,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2019-11-28 02:46:26,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:46:26,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:26,032 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,032 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2019-11-28 02:46:26,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337552694] [2019-11-28 02:46:26,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:26,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337552694] [2019-11-28 02:46:26,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999488301] [2019-11-28 02:46:26,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,073 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2019-11-28 02:46:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,104 INFO L93 Difference]: Finished difference Result 154 states and 243 transitions. [2019-11-28 02:46:26,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 02:46:26,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,107 INFO L225 Difference]: With dead ends: 154 [2019-11-28 02:46:26,107 INFO L226 Difference]: Without dead ends: 154 [2019-11-28 02:46:26,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-28 02:46:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2019-11-28 02:46:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 02:46:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2019-11-28 02:46:26,130 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2019-11-28 02:46:26,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,131 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2019-11-28 02:46:26,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,131 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2019-11-28 02:46:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:46:26,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:26,136 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2019-11-28 02:46:26,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023626214] [2019-11-28 02:46:26,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:26,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023626214] [2019-11-28 02:46:26,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537998106] [2019-11-28 02:46:26,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,190 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2019-11-28 02:46:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,223 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2019-11-28 02:46:26,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 02:46:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,226 INFO L225 Difference]: With dead ends: 162 [2019-11-28 02:46:26,226 INFO L226 Difference]: Without dead ends: 162 [2019-11-28 02:46:26,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-28 02:46:26,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-11-28 02:46:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-28 02:46:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2019-11-28 02:46:26,250 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2019-11-28 02:46:26,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,252 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2019-11-28 02:46:26,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2019-11-28 02:46:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:26,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,255 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:26,255 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2019-11-28 02:46:26,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141287206] [2019-11-28 02:46:26,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:26,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141287206] [2019-11-28 02:46:26,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027293662] [2019-11-28 02:46:26,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,294 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2019-11-28 02:46:26,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,318 INFO L93 Difference]: Finished difference Result 166 states and 243 transitions. [2019-11-28 02:46:26,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:46:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,320 INFO L225 Difference]: With dead ends: 166 [2019-11-28 02:46:26,321 INFO L226 Difference]: Without dead ends: 166 [2019-11-28 02:46:26,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-28 02:46:26,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-11-28 02:46:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-28 02:46:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2019-11-28 02:46:26,333 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2019-11-28 02:46:26,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,336 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2019-11-28 02:46:26,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,336 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2019-11-28 02:46:26,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:26,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,341 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:26,344 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2019-11-28 02:46:26,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790658129] [2019-11-28 02:46:26,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:26,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790658129] [2019-11-28 02:46:26,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276059456] [2019-11-28 02:46:26,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,395 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2019-11-28 02:46:26,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,413 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-11-28 02:46:26,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:46:26,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,417 INFO L225 Difference]: With dead ends: 282 [2019-11-28 02:46:26,419 INFO L226 Difference]: Without dead ends: 282 [2019-11-28 02:46:26,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-28 02:46:26,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-11-28 02:46:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-28 02:46:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2019-11-28 02:46:26,430 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2019-11-28 02:46:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,430 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2019-11-28 02:46:26,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2019-11-28 02:46:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:26,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:26,432 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2019-11-28 02:46:26,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089095834] [2019-11-28 02:46:26,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:26,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089095834] [2019-11-28 02:46:26,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137968146] [2019-11-28 02:46:26,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,463 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2019-11-28 02:46:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,483 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2019-11-28 02:46:26,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:46:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,488 INFO L225 Difference]: With dead ends: 306 [2019-11-28 02:46:26,488 INFO L226 Difference]: Without dead ends: 306 [2019-11-28 02:46:26,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-28 02:46:26,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-11-28 02:46:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-28 02:46:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-11-28 02:46:26,498 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2019-11-28 02:46:26,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,499 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-11-28 02:46:26,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-11-28 02:46:26,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:26,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:26,501 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,502 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2019-11-28 02:46:26,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919082678] [2019-11-28 02:46:26,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:26,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919082678] [2019-11-28 02:46:26,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911062851] [2019-11-28 02:46:26,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,537 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2019-11-28 02:46:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,554 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2019-11-28 02:46:26,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:46:26,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,556 INFO L225 Difference]: With dead ends: 314 [2019-11-28 02:46:26,556 INFO L226 Difference]: Without dead ends: 314 [2019-11-28 02:46:26,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-28 02:46:26,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-11-28 02:46:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-11-28 02:46:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2019-11-28 02:46:26,566 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2019-11-28 02:46:26,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,567 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2019-11-28 02:46:26,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2019-11-28 02:46:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:26,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,568 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:26,569 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,569 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2019-11-28 02:46:26,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555329584] [2019-11-28 02:46:26,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:26,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555329584] [2019-11-28 02:46:26,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140720233] [2019-11-28 02:46:26,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,602 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2019-11-28 02:46:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,616 INFO L93 Difference]: Finished difference Result 522 states and 695 transitions. [2019-11-28 02:46:26,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:46:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,619 INFO L225 Difference]: With dead ends: 522 [2019-11-28 02:46:26,620 INFO L226 Difference]: Without dead ends: 522 [2019-11-28 02:46:26,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-11-28 02:46:26,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2019-11-28 02:46:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-28 02:46:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-11-28 02:46:26,635 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2019-11-28 02:46:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,635 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-11-28 02:46:26,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-11-28 02:46:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:26,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:26,637 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2019-11-28 02:46:26,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234772808] [2019-11-28 02:46:26,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:26,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234772808] [2019-11-28 02:46:26,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200223530] [2019-11-28 02:46:26,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,660 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2019-11-28 02:46:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,677 INFO L93 Difference]: Finished difference Result 586 states and 727 transitions. [2019-11-28 02:46:26,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:46:26,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,680 INFO L225 Difference]: With dead ends: 586 [2019-11-28 02:46:26,680 INFO L226 Difference]: Without dead ends: 586 [2019-11-28 02:46:26,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-28 02:46:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-11-28 02:46:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-28 02:46:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2019-11-28 02:46:26,697 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2019-11-28 02:46:26,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,697 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2019-11-28 02:46:26,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,698 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2019-11-28 02:46:26,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:26,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,699 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:26,699 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,700 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2019-11-28 02:46:26,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038610568] [2019-11-28 02:46:26,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:26,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038610568] [2019-11-28 02:46:26,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434616775] [2019-11-28 02:46:26,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,722 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2019-11-28 02:46:26,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,741 INFO L93 Difference]: Finished difference Result 602 states and 727 transitions. [2019-11-28 02:46:26,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:26,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,745 INFO L225 Difference]: With dead ends: 602 [2019-11-28 02:46:26,745 INFO L226 Difference]: Without dead ends: 602 [2019-11-28 02:46:26,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-11-28 02:46:26,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-11-28 02:46:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-28 02:46:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2019-11-28 02:46:26,761 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2019-11-28 02:46:26,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,762 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2019-11-28 02:46:26,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2019-11-28 02:46:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:26,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:26,764 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,764 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2019-11-28 02:46:26,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5694711] [2019-11-28 02:46:26,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:26,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5694711] [2019-11-28 02:46:26,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173737739] [2019-11-28 02:46:26,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,787 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2019-11-28 02:46:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,804 INFO L93 Difference]: Finished difference Result 968 states and 1126 transitions. [2019-11-28 02:46:26,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,810 INFO L225 Difference]: With dead ends: 968 [2019-11-28 02:46:26,810 INFO L226 Difference]: Without dead ends: 968 [2019-11-28 02:46:26,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-11-28 02:46:26,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2019-11-28 02:46:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-11-28 02:46:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2019-11-28 02:46:26,835 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2019-11-28 02:46:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,836 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2019-11-28 02:46:26,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2019-11-28 02:46:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:26,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:26,839 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,840 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2019-11-28 02:46:26,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890974101] [2019-11-28 02:46:26,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:26,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890974101] [2019-11-28 02:46:26,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219805995] [2019-11-28 02:46:26,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,861 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2019-11-28 02:46:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,888 INFO L93 Difference]: Finished difference Result 1126 states and 1221 transitions. [2019-11-28 02:46:26,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:26,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,890 INFO L225 Difference]: With dead ends: 1126 [2019-11-28 02:46:26,890 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:46:26,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:46:26,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:46:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:46:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:46:26,892 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-28 02:46:26,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,892 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:46:26,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:46:26,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:46:26,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:46:26 BoogieIcfgContainer [2019-11-28 02:46:26,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:46:26,899 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:46:26,899 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:46:26,900 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:46:26,900 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:25" (3/4) ... [2019-11-28 02:46:26,905 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:46:26,913 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:46:26,914 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:46:26,920 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:46:26,920 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:46:26,920 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:46:26,982 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:46:26,982 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:46:26,984 INFO L168 Benchmark]: Toolchain (without parser) took 2591.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 955.0 MB in the beginning and 963.0 MB in the end (delta: -8.0 MB). Peak memory consumption was 145.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:26,985 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:46:26,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.17 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:26,986 INFO L168 Benchmark]: Boogie Preprocessor took 101.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -199.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:26,986 INFO L168 Benchmark]: RCFGBuilder took 347.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:26,987 INFO L168 Benchmark]: TraceAbstraction took 1797.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 969.5 MB in the end (delta: 155.6 MB). Peak memory consumption was 155.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:26,987 INFO L168 Benchmark]: Witness Printer took 82.63 ms. Allocated memory is still 1.2 GB. Free memory was 969.5 MB in the beginning and 963.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:26,989 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.17 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -199.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 347.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1797.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 969.5 MB in the end (delta: 155.6 MB). Peak memory consumption was 155.6 MB. Max. memory is 11.5 GB. * Witness Printer took 82.63 ms. Allocated memory is still 1.2 GB. Free memory was 969.5 MB in the beginning and 963.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 1.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...