./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.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/ntdrivers-simplified/kbfiltr_simpl1.cil.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 a3956b9d522359ca85af7edde8f84196cd7ca984 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:45:59,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:45:59,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:45:59,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:45:59,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:45:59,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:45:59,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:45:59,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:45:59,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:45:59,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:45:59,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:45:59,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:45:59,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:45:59,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:45:59,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:45:59,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:45:59,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:45:59,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:45:59,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:45:59,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:45:59,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:45:59,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:45:59,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:45:59,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:45:59,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:45:59,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:45:59,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:45:59,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:45:59,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:45:59,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:45:59,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:45:59,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:45:59,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:45:59,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:45:59,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:45:59,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:45:59,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:45:59,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:45:59,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:45:59,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:45:59,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:45:59,198 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:45:59,234 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:45:59,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:45:59,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:45:59,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:45:59,241 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:45:59,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:45:59,241 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:45:59,242 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:45:59,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:45:59,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:45:59,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:45:59,244 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:45:59,244 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:45:59,245 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:45:59,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:45:59,247 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:45:59,247 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:45:59,248 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:45:59,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:45:59,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:45:59,248 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:45:59,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:45:59,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:45:59,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:45:59,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:45:59,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:45:59,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:45:59,251 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 -> a3956b9d522359ca85af7edde8f84196cd7ca984 [2019-11-28 02:45:59,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:45:59,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:45:59,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:45:59,597 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:45:59,597 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:45:59,598 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-11-28 02:45:59,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98039c848/2e81fe0d33914dd69c0f48955aa9ca0f/FLAG1896da77a [2019-11-28 02:46:00,121 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:46:00,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-11-28 02:46:00,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98039c848/2e81fe0d33914dd69c0f48955aa9ca0f/FLAG1896da77a [2019-11-28 02:46:00,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98039c848/2e81fe0d33914dd69c0f48955aa9ca0f [2019-11-28 02:46:00,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:46:00,493 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:46:00,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:00,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:46:00,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:46:00,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:00" (1/1) ... [2019-11-28 02:46:00,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff4ef9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:00, skipping insertion in model container [2019-11-28 02:46:00,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:00" (1/1) ... [2019-11-28 02:46:00,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:46:00,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:46:00,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:00,930 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:46:01,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:01,124 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:46:01,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:01 WrapperNode [2019-11-28 02:46:01,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:01,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:46:01,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:46:01,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:46:01,142 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:01" (1/1) ... [2019-11-28 02:46:01,142 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:01" (1/1) ... [2019-11-28 02:46:01,170 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:01" (1/1) ... [2019-11-28 02:46:01,171 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:01" (1/1) ... [2019-11-28 02:46:01,195 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:01" (1/1) ... [2019-11-28 02:46:01,212 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:01" (1/1) ... [2019-11-28 02:46:01,215 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:01" (1/1) ... [2019-11-28 02:46:01,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:46:01,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:46:01,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:46:01,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:46:01,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:01" (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:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:46:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:46:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-11-28 02:46:01,316 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-11-28 02:46:01,316 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-11-28 02:46:01,317 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:46:01,318 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-11-28 02:46:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-11-28 02:46:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-11-28 02:46:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-11-28 02:46:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-11-28 02:46:01,321 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-11-28 02:46:01,321 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-11-28 02:46:01,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:46:01,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-28 02:46:01,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:46:01,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-28 02:46:01,325 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-11-28 02:46:01,325 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-11-28 02:46:01,325 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-11-28 02:46:01,325 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-11-28 02:46:01,326 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-11-28 02:46:01,326 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-11-28 02:46:01,326 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-11-28 02:46:01,326 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-11-28 02:46:01,327 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-11-28 02:46:01,327 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:46:01,327 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-11-28 02:46:01,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:46:01,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:46:01,641 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 02:46:01,765 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-11-28 02:46:01,766 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-11-28 02:46:01,767 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 02:46:01,835 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2019-11-28 02:46:01,836 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2019-11-28 02:46:01,875 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 02:46:01,921 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-11-28 02:46:01,921 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-11-28 02:46:01,945 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 02:46:02,079 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-11-28 02:46:02,079 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-11-28 02:46:02,089 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:46:02,089 INFO L297 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-28 02:46:02,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:02 BoogieIcfgContainer [2019-11-28 02:46:02,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:46:02,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:46:02,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:46:02,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:46:02,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:46:00" (1/3) ... [2019-11-28 02:46:02,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5394d5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:02, skipping insertion in model container [2019-11-28 02:46:02,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:01" (2/3) ... [2019-11-28 02:46:02,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5394d5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:02, skipping insertion in model container [2019-11-28 02:46:02,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:02" (3/3) ... [2019-11-28 02:46:02,100 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2019-11-28 02:46:02,111 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:46:02,119 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 02:46:02,132 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 02:46:02,152 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:46:02,153 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:46:02,153 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:46:02,153 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:46:02,154 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:46:02,154 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:46:02,154 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:46:02,154 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:46:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-28 02:46:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:02,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:02,189 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:02,189 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:02,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2019-11-28 02:46:02,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:02,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523487930] [2019-11-28 02:46:02,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:02,615 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:02,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523487930] [2019-11-28 02:46:02,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:02,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:46:02,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713357420] [2019-11-28 02:46:02,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:46:02,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:02,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:46:02,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:46:02,644 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2019-11-28 02:46:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:03,320 INFO L93 Difference]: Finished difference Result 169 states and 237 transitions. [2019-11-28 02:46:03,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:03,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-28 02:46:03,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:03,342 INFO L225 Difference]: With dead ends: 169 [2019-11-28 02:46:03,343 INFO L226 Difference]: Without dead ends: 157 [2019-11-28 02:46:03,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:46:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-28 02:46:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2019-11-28 02:46:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 02:46:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2019-11-28 02:46:03,448 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2019-11-28 02:46:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:03,448 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2019-11-28 02:46:03,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:46:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2019-11-28 02:46:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:46:03,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:03,451 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, 1, 1, 1, 1, 1] [2019-11-28 02:46:03,451 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2019-11-28 02:46:03,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:03,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219326254] [2019-11-28 02:46:03,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:03,834 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:03,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219326254] [2019-11-28 02:46:03,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:03,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:46:03,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791603685] [2019-11-28 02:46:03,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:46:03,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:03,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:46:03,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:46:03,845 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2019-11-28 02:46:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:04,697 INFO L93 Difference]: Finished difference Result 220 states and 292 transitions. [2019-11-28 02:46:04,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:46:04,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-28 02:46:04,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:04,701 INFO L225 Difference]: With dead ends: 220 [2019-11-28 02:46:04,702 INFO L226 Difference]: Without dead ends: 219 [2019-11-28 02:46:04,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:46:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-28 02:46:04,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2019-11-28 02:46:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-11-28 02:46:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2019-11-28 02:46:04,746 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2019-11-28 02:46:04,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:04,747 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2019-11-28 02:46:04,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:46:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2019-11-28 02:46:04,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:04,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:04,748 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, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:04,749 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:04,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:04,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2019-11-28 02:46:04,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:04,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516967991] [2019-11-28 02:46:04,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:05,001 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:05,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516967991] [2019-11-28 02:46:05,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:05,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:46:05,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014654912] [2019-11-28 02:46:05,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:46:05,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:05,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:46:05,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:46:05,004 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand 7 states. [2019-11-28 02:46:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:05,785 INFO L93 Difference]: Finished difference Result 254 states and 335 transitions. [2019-11-28 02:46:05,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:46:05,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-28 02:46:05,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:05,789 INFO L225 Difference]: With dead ends: 254 [2019-11-28 02:46:05,789 INFO L226 Difference]: Without dead ends: 254 [2019-11-28 02:46:05,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:46:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-28 02:46:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2019-11-28 02:46:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-28 02:46:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2019-11-28 02:46:05,809 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2019-11-28 02:46:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:05,810 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2019-11-28 02:46:05,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:46:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2019-11-28 02:46:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 02:46:05,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:05,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:05,813 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:05,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:05,813 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2019-11-28 02:46:05,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:05,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817584909] [2019-11-28 02:46:05,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:05,994 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:05,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817584909] [2019-11-28 02:46:05,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:05,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:46:05,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508562716] [2019-11-28 02:46:05,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:46:05,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:05,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:46:05,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:46:05,997 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 7 states. [2019-11-28 02:46:06,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:06,809 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2019-11-28 02:46:06,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:46:06,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-11-28 02:46:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:06,813 INFO L225 Difference]: With dead ends: 217 [2019-11-28 02:46:06,813 INFO L226 Difference]: Without dead ends: 217 [2019-11-28 02:46:06,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:46:06,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-28 02:46:06,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-11-28 02:46:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-28 02:46:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2019-11-28 02:46:06,827 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2019-11-28 02:46:06,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:06,827 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2019-11-28 02:46:06,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:46:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2019-11-28 02:46:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 02:46:06,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:06,831 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, 1, 1, 1, 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:06,831 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:06,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2019-11-28 02:46:06,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:06,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131321889] [2019-11-28 02:46:06,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,016 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:07,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131321889] [2019-11-28 02:46:07,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:07,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:46:07,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60863017] [2019-11-28 02:46:07,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:46:07,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:07,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:46:07,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:46:07,020 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand 8 states. [2019-11-28 02:46:07,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:07,911 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2019-11-28 02:46:07,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:46:07,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-28 02:46:07,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:07,914 INFO L225 Difference]: With dead ends: 208 [2019-11-28 02:46:07,915 INFO L226 Difference]: Without dead ends: 208 [2019-11-28 02:46:07,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:46:07,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-28 02:46:07,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2019-11-28 02:46:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-28 02:46:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2019-11-28 02:46:07,927 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2019-11-28 02:46:07,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:07,928 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2019-11-28 02:46:07,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:46:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2019-11-28 02:46:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 02:46:07,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:07,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,932 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:07,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:07,932 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2019-11-28 02:46:07,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:07,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445502746] [2019-11-28 02:46:07,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,111 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:08,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445502746] [2019-11-28 02:46:08,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:46:08,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869022676] [2019-11-28 02:46:08,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:46:08,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:46:08,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:46:08,115 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand 8 states. [2019-11-28 02:46:08,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,511 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2019-11-28 02:46:08,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:46:08,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-28 02:46:08,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,513 INFO L225 Difference]: With dead ends: 197 [2019-11-28 02:46:08,514 INFO L226 Difference]: Without dead ends: 197 [2019-11-28 02:46:08,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:46:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-28 02:46:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2019-11-28 02:46:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-28 02:46:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2019-11-28 02:46:08,534 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2019-11-28 02:46:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,535 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2019-11-28 02:46:08,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:46:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2019-11-28 02:46:08,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 02:46:08,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,545 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,546 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2019-11-28 02:46:08,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341323164] [2019-11-28 02:46:08,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,743 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:08,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341323164] [2019-11-28 02:46:08,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:46:08,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797083280] [2019-11-28 02:46:08,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:46:08,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:46:08,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:46:08,747 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand 8 states. [2019-11-28 02:46:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:09,007 INFO L93 Difference]: Finished difference Result 184 states and 239 transitions. [2019-11-28 02:46:09,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:46:09,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-28 02:46:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:09,009 INFO L225 Difference]: With dead ends: 184 [2019-11-28 02:46:09,009 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 02:46:09,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:46:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 02:46:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-11-28 02:46:09,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 02:46:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-11-28 02:46:09,020 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 50 [2019-11-28 02:46:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:09,021 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-11-28 02:46:09,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:46:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-11-28 02:46:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 02:46:09,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:09,028 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,028 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:09,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2019-11-28 02:46:09,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:09,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218309576] [2019-11-28 02:46:09,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,297 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:09,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218309576] [2019-11-28 02:46:09,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 02:46:09,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427754998] [2019-11-28 02:46:09,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:46:09,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:46:09,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:09,300 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 12 states. [2019-11-28 02:46:09,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:09,602 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2019-11-28 02:46:09,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:46:09,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-11-28 02:46:09,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:09,604 INFO L225 Difference]: With dead ends: 108 [2019-11-28 02:46:09,604 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 02:46:09,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:46:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 02:46:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-11-28 02:46:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 02:46:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-11-28 02:46:09,610 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 59 [2019-11-28 02:46:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:09,611 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-11-28 02:46:09,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:46:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-11-28 02:46:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 02:46:09,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:09,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,613 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:09,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:09,613 INFO L82 PathProgramCache]: Analyzing trace with hash -367309916, now seen corresponding path program 1 times [2019-11-28 02:46:09,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:09,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998058941] [2019-11-28 02:46:09,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,873 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:09,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998058941] [2019-11-28 02:46:09,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 02:46:09,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158267858] [2019-11-28 02:46:09,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:46:09,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:46:09,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:09,876 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 12 states. [2019-11-28 02:46:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:10,352 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2019-11-28 02:46:10,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:46:10,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-11-28 02:46:10,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:10,353 INFO L225 Difference]: With dead ends: 106 [2019-11-28 02:46:10,353 INFO L226 Difference]: Without dead ends: 106 [2019-11-28 02:46:10,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:46:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-28 02:46:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-11-28 02:46:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 02:46:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2019-11-28 02:46:10,358 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 59 [2019-11-28 02:46:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:10,359 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2019-11-28 02:46:10,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:46:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2019-11-28 02:46:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 02:46:10,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:10,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,361 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:10,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:10,361 INFO L82 PathProgramCache]: Analyzing trace with hash 857146700, now seen corresponding path program 1 times [2019-11-28 02:46:10,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:10,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505190746] [2019-11-28 02:46:10,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,555 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:10,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505190746] [2019-11-28 02:46:10,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:10,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 02:46:10,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239420197] [2019-11-28 02:46:10,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:46:10,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:10,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:46:10,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:46:10,559 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 9 states. [2019-11-28 02:46:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:10,828 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2019-11-28 02:46:10,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:46:10,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-11-28 02:46:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:10,830 INFO L225 Difference]: With dead ends: 192 [2019-11-28 02:46:10,830 INFO L226 Difference]: Without dead ends: 192 [2019-11-28 02:46:10,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:46:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-28 02:46:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 180. [2019-11-28 02:46:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-28 02:46:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 200 transitions. [2019-11-28 02:46:10,839 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 200 transitions. Word has length 60 [2019-11-28 02:46:10,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:10,839 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 200 transitions. [2019-11-28 02:46:10,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:46:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 200 transitions. [2019-11-28 02:46:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 02:46:10,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:10,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,842 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:10,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:10,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1662813234, now seen corresponding path program 1 times [2019-11-28 02:46:10,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:10,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197667068] [2019-11-28 02:46:10,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,080 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:11,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197667068] [2019-11-28 02:46:11,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:11,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 02:46:11,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601837311] [2019-11-28 02:46:11,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:46:11,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:11,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:46:11,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:11,085 INFO L87 Difference]: Start difference. First operand 180 states and 200 transitions. Second operand 12 states. [2019-11-28 02:46:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:11,521 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2019-11-28 02:46:11,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:46:11,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-11-28 02:46:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:11,523 INFO L225 Difference]: With dead ends: 158 [2019-11-28 02:46:11,524 INFO L226 Difference]: Without dead ends: 150 [2019-11-28 02:46:11,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:46:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-28 02:46:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-28 02:46:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-28 02:46:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2019-11-28 02:46:11,532 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 60 [2019-11-28 02:46:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:11,533 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2019-11-28 02:46:11,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:46:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2019-11-28 02:46:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 02:46:11,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:11,534 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,535 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:11,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:11,535 INFO L82 PathProgramCache]: Analyzing trace with hash -673462309, now seen corresponding path program 1 times [2019-11-28 02:46:11,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:11,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718934720] [2019-11-28 02:46:11,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,853 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:11,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718934720] [2019-11-28 02:46:11,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:11,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 02:46:11,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591838481] [2019-11-28 02:46:11,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:46:11,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:11,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:46:11,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:46:11,856 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand 9 states. [2019-11-28 02:46:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:12,045 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2019-11-28 02:46:12,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:46:12,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-11-28 02:46:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:12,049 INFO L225 Difference]: With dead ends: 167 [2019-11-28 02:46:12,049 INFO L226 Difference]: Without dead ends: 165 [2019-11-28 02:46:12,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:46:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-28 02:46:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 154. [2019-11-28 02:46:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 02:46:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 165 transitions. [2019-11-28 02:46:12,059 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 165 transitions. Word has length 62 [2019-11-28 02:46:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:12,059 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 165 transitions. [2019-11-28 02:46:12,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:46:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 165 transitions. [2019-11-28 02:46:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 02:46:12,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:12,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,061 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:12,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:12,061 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2019-11-28 02:46:12,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:12,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293410897] [2019-11-28 02:46:12,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,371 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:12,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293410897] [2019-11-28 02:46:12,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:12,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 02:46:12,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051073840] [2019-11-28 02:46:12,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:46:12,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:12,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:46:12,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:46:12,374 INFO L87 Difference]: Start difference. First operand 154 states and 165 transitions. Second operand 11 states. [2019-11-28 02:46:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:12,837 INFO L93 Difference]: Finished difference Result 147 states and 153 transitions. [2019-11-28 02:46:12,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 02:46:12,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-11-28 02:46:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:12,839 INFO L225 Difference]: With dead ends: 147 [2019-11-28 02:46:12,840 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 02:46:12,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:46:12,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 02:46:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-28 02:46:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-28 02:46:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-11-28 02:46:12,846 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2019-11-28 02:46:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:12,846 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-11-28 02:46:12,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:46:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-11-28 02:46:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 02:46:12,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:12,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,848 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:12,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:12,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2019-11-28 02:46:12,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:12,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621318125] [2019-11-28 02:46:12,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,136 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:13,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621318125] [2019-11-28 02:46:13,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:13,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 02:46:13,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019393823] [2019-11-28 02:46:13,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:46:13,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:13,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:46:13,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:13,139 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 12 states. [2019-11-28 02:46:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:13,407 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-11-28 02:46:13,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:46:13,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-11-28 02:46:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:13,410 INFO L225 Difference]: With dead ends: 133 [2019-11-28 02:46:13,411 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 02:46:13,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:46:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 02:46:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-28 02:46:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-28 02:46:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2019-11-28 02:46:13,416 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2019-11-28 02:46:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:13,417 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2019-11-28 02:46:13,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:46:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2019-11-28 02:46:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 02:46:13,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:13,419 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,419 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:13,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:13,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2019-11-28 02:46:13,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:13,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620833758] [2019-11-28 02:46:13,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,623 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:13,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620833758] [2019-11-28 02:46:13,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:13,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 02:46:13,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734522446] [2019-11-28 02:46:13,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:46:13,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:13,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:46:13,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:13,625 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 12 states. [2019-11-28 02:46:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:13,822 INFO L93 Difference]: Finished difference Result 104 states and 103 transitions. [2019-11-28 02:46:13,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:46:13,822 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-11-28 02:46:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:13,823 INFO L225 Difference]: With dead ends: 104 [2019-11-28 02:46:13,823 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:46:13,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:46:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:46:13,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:46:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:46:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:46:13,824 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2019-11-28 02:46:13,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:13,824 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:46:13,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:46:13,824 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:46:13,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:46:13,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:46:13 BoogieIcfgContainer [2019-11-28 02:46:13,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:46:13,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:46:13,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:46:13,832 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:46:13,832 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:02" (3/4) ... [2019-11-28 02:46:13,836 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:46:13,844 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2019-11-28 02:46:13,845 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Complete [2019-11-28 02:46:13,845 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2019-11-28 02:46:13,845 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2019-11-28 02:46:13,845 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2019-11-28 02:46:13,845 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:46:13,845 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2019-11-28 02:46:13,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2019-11-28 02:46:13,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:46:13,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2019-11-28 02:46:13,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2019-11-28 02:46:13,847 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_PnP [2019-11-28 02:46:13,860 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2019-11-28 02:46:13,861 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-28 02:46:13,862 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:46:14,022 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:46:14,023 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:46:14,025 INFO L168 Benchmark]: Toolchain (without parser) took 13532.16 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.9 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -256.4 MB). Peak memory consumption was 118.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:14,026 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:46:14,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:14,027 INFO L168 Benchmark]: Boogie Preprocessor took 100.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:46:14,027 INFO L168 Benchmark]: RCFGBuilder took 863.70 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: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:14,030 INFO L168 Benchmark]: TraceAbstraction took 11737.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -161.4 MB). Peak memory consumption was 79.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:14,031 INFO L168 Benchmark]: Witness Printer took 193.00 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:14,033 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 631.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 100.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 863.70 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: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11737.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -161.4 MB). Peak memory consumption was 79.8 MB. Max. memory is 11.5 GB. * Witness Printer took 193.00 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 579]: 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 13 procedures, 151 locations, 1 error locations. Result: SAFE, OverallTime: 11.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1748 SDtfs, 2265 SDslu, 2224 SDs, 0 SdLazy, 4142 SolverSat, 626 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 149 SyntacticMatches, 4 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=3, 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, 15 MinimizatonAttempts, 134 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 756 NumberOfCodeBlocks, 756 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 741 ConstructedInterpolants, 0 QuantifiedInterpolants, 166358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...