./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 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/AutomizerReach.xml -i ../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a85198d3f93b8c751f2c6e712deab62f97c1022f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/AutomizerReach.xml -i ../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a85198d3f93b8c751f2c6e712deab62f97c1022f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:26:52,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:26:52,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:26:52,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:26:52,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:26:52,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:26:52,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:26:52,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:26:52,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:26:52,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:26:52,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:26:52,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:26:52,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:26:52,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:26:52,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:26:52,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:26:52,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:26:52,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:26:52,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:26:52,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:26:52,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:26:52,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:26:52,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:26:52,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:26:52,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:26:52,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:26:52,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:26:52,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:26:52,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:26:52,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:26:52,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:26:52,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:26:52,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:26:52,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:26:52,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:26:52,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:26:52,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:26:52,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:26:52,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:26:52,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:26:52,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:26:52,248 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:26:52,272 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:26:52,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:26:52,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:26:52,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:26:52,275 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:26:52,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:26:52,276 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:26:52,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:26:52,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:26:52,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:26:52,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:26:52,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:26:52,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:26:52,279 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:26:52,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:26:52,279 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:26:52,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:26:52,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:26:52,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:26:52,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:26:52,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:26:52,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:26:52,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:26:52,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:26:52,282 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:26:52,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:26:52,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:26:52,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:26:52,283 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 ! call(__VERIFIER_error())) ) 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 -> a85198d3f93b8c751f2c6e712deab62f97c1022f [2019-11-19 18:26:52,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:26:52,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:26:52,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:26:52,695 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:26:52,696 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:26:52,697 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-19 18:26:52,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/584359deb/04393c218d6c44d6aa95fe4c1b87de9c/FLAG12bb2070d [2019-11-19 18:26:53,400 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:26:53,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-19 18:26:53,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/584359deb/04393c218d6c44d6aa95fe4c1b87de9c/FLAG12bb2070d [2019-11-19 18:26:53,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/584359deb/04393c218d6c44d6aa95fe4c1b87de9c [2019-11-19 18:26:53,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:26:53,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:26:53,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:26:53,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:26:53,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:26:53,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:53" (1/1) ... [2019-11-19 18:26:53,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69128cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:53, skipping insertion in model container [2019-11-19 18:26:53,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:53" (1/1) ... [2019-11-19 18:26:53,611 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:26:53,683 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:26:54,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:26:54,321 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:26:54,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:26:54,580 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:26:54,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:54 WrapperNode [2019-11-19 18:26:54,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:26:54,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:26:54,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:26:54,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:26:54,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:54" (1/1) ... [2019-11-19 18:26:54,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:54" (1/1) ... [2019-11-19 18:26:54,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:26:54,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:26:54,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:26:54,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:26:54,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:54" (1/1) ... [2019-11-19 18:26:54,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:54" (1/1) ... [2019-11-19 18:26:54,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:54" (1/1) ... [2019-11-19 18:26:54,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:54" (1/1) ... [2019-11-19 18:26:54,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:54" (1/1) ... [2019-11-19 18:26:54,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:54" (1/1) ... [2019-11-19 18:26:54,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:54" (1/1) ... [2019-11-19 18:26:54,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:26:54,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:26:54,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:26:54,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:26:54,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:54" (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-19 18:26:54,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 18:26:54,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 18:26:54,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 18:26:54,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 18:26:54,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 18:26:54,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 18:26:54,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:26:54,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:26:55,147 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 18:26:55,986 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-19 18:26:55,987 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-19 18:26:55,989 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:26:55,989 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 18:26:55,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:55 BoogieIcfgContainer [2019-11-19 18:26:55,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:26:55,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:26:55,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:26:55,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:26:55,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:26:53" (1/3) ... [2019-11-19 18:26:55,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269ef408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:26:55, skipping insertion in model container [2019-11-19 18:26:55,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:54" (2/3) ... [2019-11-19 18:26:55,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269ef408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:26:55, skipping insertion in model container [2019-11-19 18:26:55,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:55" (3/3) ... [2019-11-19 18:26:56,000 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-11-19 18:26:56,010 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:26:56,018 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:26:56,030 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:26:56,056 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:26:56,057 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:26:56,057 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:26:56,057 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:26:56,058 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:26:56,058 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:26:56,058 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:26:56,058 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:26:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-19 18:26:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 18:26:56,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:56,089 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-19 18:26:56,089 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:56,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-19 18:26:56,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:56,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618346920] [2019-11-19 18:26:56,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:56,436 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-19 18:26:56,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618346920] [2019-11-19 18:26:56,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:56,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:26:56,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570907326] [2019-11-19 18:26:56,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:26:56,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:56,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:26:56,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:26:56,462 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-19 18:26:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:56,919 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-11-19 18:26:56,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:26:56,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-19 18:26:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:56,946 INFO L225 Difference]: With dead ends: 313 [2019-11-19 18:26:56,947 INFO L226 Difference]: Without dead ends: 158 [2019-11-19 18:26:56,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:26:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-19 18:26:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-19 18:26:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 18:26:57,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-11-19 18:26:57,020 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-11-19 18:26:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:57,021 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-11-19 18:26:57,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:26:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-11-19 18:26:57,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 18:26:57,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:57,026 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:57,027 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:57,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:57,027 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-11-19 18:26:57,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:57,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489224669] [2019-11-19 18:26:57,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:57,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:26:57,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489224669] [2019-11-19 18:26:57,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:57,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:26:57,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767080935] [2019-11-19 18:26:57,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:26:57,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:57,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:26:57,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:26:57,216 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-11-19 18:26:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:57,598 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-11-19 18:26:57,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:26:57,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-19 18:26:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:57,600 INFO L225 Difference]: With dead ends: 280 [2019-11-19 18:26:57,603 INFO L226 Difference]: Without dead ends: 158 [2019-11-19 18:26:57,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:26:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-19 18:26:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-19 18:26:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 18:26:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-11-19 18:26:57,621 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-11-19 18:26:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:57,621 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-11-19 18:26:57,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:26:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-11-19 18:26:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 18:26:57,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:57,626 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:57,626 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:57,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:57,627 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-11-19 18:26:57,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:57,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153137711] [2019-11-19 18:26:57,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:26:57,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153137711] [2019-11-19 18:26:57,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:57,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:26:57,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701177397] [2019-11-19 18:26:57,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:26:57,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:57,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:26:57,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:26:57,745 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-11-19 18:26:58,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:58,091 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-11-19 18:26:58,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:26:58,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 18:26:58,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:58,093 INFO L225 Difference]: With dead ends: 279 [2019-11-19 18:26:58,093 INFO L226 Difference]: Without dead ends: 157 [2019-11-19 18:26:58,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:26:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-19 18:26:58,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-11-19 18:26:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 18:26:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-11-19 18:26:58,106 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-11-19 18:26:58,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:58,107 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-11-19 18:26:58,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:26:58,107 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-11-19 18:26:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 18:26:58,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:58,110 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:58,110 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:58,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:58,110 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-11-19 18:26:58,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:58,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381249397] [2019-11-19 18:26:58,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:26:58,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381249397] [2019-11-19 18:26:58,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:58,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:26:58,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686339751] [2019-11-19 18:26:58,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:26:58,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:58,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:26:58,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:26:58,238 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-11-19 18:26:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:58,514 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-11-19 18:26:58,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:26:58,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 18:26:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:58,516 INFO L225 Difference]: With dead ends: 277 [2019-11-19 18:26:58,516 INFO L226 Difference]: Without dead ends: 155 [2019-11-19 18:26:58,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:26:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-19 18:26:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-11-19 18:26:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 18:26:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-11-19 18:26:58,527 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-11-19 18:26:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:58,527 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-11-19 18:26:58,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:26:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-11-19 18:26:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 18:26:58,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:58,530 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:58,530 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:58,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:58,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-11-19 18:26:58,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:58,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435328499] [2019-11-19 18:26:58,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:26:58,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435328499] [2019-11-19 18:26:58,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:58,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:26:58,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981034447] [2019-11-19 18:26:58,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:26:58,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:58,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:26:58,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:26:58,620 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-11-19 18:26:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:58,900 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-11-19 18:26:58,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:26:58,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 18:26:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:58,902 INFO L225 Difference]: With dead ends: 276 [2019-11-19 18:26:58,902 INFO L226 Difference]: Without dead ends: 154 [2019-11-19 18:26:58,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:26:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-19 18:26:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-19 18:26:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 18:26:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-11-19 18:26:58,911 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-11-19 18:26:58,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:58,911 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-11-19 18:26:58,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:26:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-11-19 18:26:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 18:26:58,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:58,913 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:58,913 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:58,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:58,914 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-11-19 18:26:58,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:58,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707942048] [2019-11-19 18:26:58,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:26:59,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707942048] [2019-11-19 18:26:59,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:59,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:26:59,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639579046] [2019-11-19 18:26:59,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:26:59,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:59,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:26:59,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:26:59,004 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-11-19 18:26:59,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:59,261 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-11-19 18:26:59,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:26:59,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 18:26:59,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:59,264 INFO L225 Difference]: With dead ends: 276 [2019-11-19 18:26:59,264 INFO L226 Difference]: Without dead ends: 154 [2019-11-19 18:26:59,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:26:59,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-19 18:26:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-19 18:26:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 18:26:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-11-19 18:26:59,270 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-11-19 18:26:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:59,271 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-11-19 18:26:59,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:26:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-11-19 18:26:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-19 18:26:59,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:59,272 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:59,272 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:59,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-11-19 18:26:59,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:59,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227207301] [2019-11-19 18:26:59,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:26:59,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227207301] [2019-11-19 18:26:59,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:59,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:26:59,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714537732] [2019-11-19 18:26:59,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:26:59,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:59,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:26:59,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:26:59,361 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-11-19 18:26:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:59,632 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-19 18:26:59,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:26:59,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-19 18:26:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:59,634 INFO L225 Difference]: With dead ends: 276 [2019-11-19 18:26:59,634 INFO L226 Difference]: Without dead ends: 154 [2019-11-19 18:26:59,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:26:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-19 18:26:59,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-19 18:26:59,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 18:26:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-11-19 18:26:59,640 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-11-19 18:26:59,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:59,640 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-11-19 18:26:59,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:26:59,641 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-11-19 18:26:59,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-19 18:26:59,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:59,642 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:59,642 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:59,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:59,642 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-11-19 18:26:59,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:59,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978778336] [2019-11-19 18:26:59,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:26:59,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978778336] [2019-11-19 18:26:59,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:59,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:26:59,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128575320] [2019-11-19 18:26:59,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:26:59,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:59,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:26:59,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:26:59,694 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-11-19 18:26:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:59,952 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-11-19 18:26:59,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:26:59,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-19 18:26:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:59,954 INFO L225 Difference]: With dead ends: 276 [2019-11-19 18:26:59,954 INFO L226 Difference]: Without dead ends: 154 [2019-11-19 18:26:59,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:26:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-19 18:26:59,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-19 18:26:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 18:26:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-11-19 18:26:59,960 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-11-19 18:26:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:59,961 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-11-19 18:26:59,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:26:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-11-19 18:26:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 18:26:59,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:59,962 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:59,963 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:59,963 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-11-19 18:26:59,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:59,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831559979] [2019-11-19 18:26:59,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:27:00,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831559979] [2019-11-19 18:27:00,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:00,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:00,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933794982] [2019-11-19 18:27:00,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:00,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:00,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:00,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:00,029 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-11-19 18:27:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:00,247 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-11-19 18:27:00,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:00,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-19 18:27:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:00,249 INFO L225 Difference]: With dead ends: 266 [2019-11-19 18:27:00,249 INFO L226 Difference]: Without dead ends: 144 [2019-11-19 18:27:00,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:00,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-19 18:27:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-11-19 18:27:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 18:27:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-11-19 18:27:00,255 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-11-19 18:27:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:00,255 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-11-19 18:27:00,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-11-19 18:27:00,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 18:27:00,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:00,257 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:00,257 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:00,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:00,258 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-11-19 18:27:00,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:00,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805757727] [2019-11-19 18:27:00,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:27:00,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805757727] [2019-11-19 18:27:00,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:00,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:00,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253542587] [2019-11-19 18:27:00,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:00,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:00,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:00,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:00,311 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-11-19 18:27:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:00,667 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2019-11-19 18:27:00,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:00,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-19 18:27:00,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:00,669 INFO L225 Difference]: With dead ends: 306 [2019-11-19 18:27:00,669 INFO L226 Difference]: Without dead ends: 184 [2019-11-19 18:27:00,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:00,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-19 18:27:00,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-19 18:27:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 18:27:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-11-19 18:27:00,678 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-11-19 18:27:00,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:00,678 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-11-19 18:27:00,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-11-19 18:27:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-19 18:27:00,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:00,680 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:00,680 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:00,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:00,681 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-11-19 18:27:00,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:00,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051515557] [2019-11-19 18:27:00,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:27:00,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051515557] [2019-11-19 18:27:00,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:00,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:00,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624512942] [2019-11-19 18:27:00,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:00,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:00,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:00,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:00,744 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-11-19 18:27:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:01,087 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2019-11-19 18:27:01,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:01,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-19 18:27:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:01,090 INFO L225 Difference]: With dead ends: 328 [2019-11-19 18:27:01,090 INFO L226 Difference]: Without dead ends: 184 [2019-11-19 18:27:01,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-19 18:27:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-19 18:27:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 18:27:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-11-19 18:27:01,097 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-11-19 18:27:01,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:01,097 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-11-19 18:27:01,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-11-19 18:27:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 18:27:01,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:01,099 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:01,099 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:01,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-11-19 18:27:01,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:01,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322834967] [2019-11-19 18:27:01,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:27:01,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322834967] [2019-11-19 18:27:01,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:01,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:01,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498292334] [2019-11-19 18:27:01,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:01,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:01,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:01,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:01,175 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-11-19 18:27:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:01,531 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2019-11-19 18:27:01,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:01,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 18:27:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:01,534 INFO L225 Difference]: With dead ends: 327 [2019-11-19 18:27:01,534 INFO L226 Difference]: Without dead ends: 183 [2019-11-19 18:27:01,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-19 18:27:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2019-11-19 18:27:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 18:27:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-11-19 18:27:01,541 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-11-19 18:27:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:01,542 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-11-19 18:27:01,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-11-19 18:27:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 18:27:01,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:01,544 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:01,544 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:01,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:01,545 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-11-19 18:27:01,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:01,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043269644] [2019-11-19 18:27:01,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:27:01,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043269644] [2019-11-19 18:27:01,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:01,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:01,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456007724] [2019-11-19 18:27:01,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:01,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:01,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:01,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:01,613 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-11-19 18:27:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:01,946 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2019-11-19 18:27:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:01,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 18:27:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:01,948 INFO L225 Difference]: With dead ends: 325 [2019-11-19 18:27:01,948 INFO L226 Difference]: Without dead ends: 181 [2019-11-19 18:27:01,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-19 18:27:01,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-19 18:27:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 18:27:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-11-19 18:27:01,954 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-11-19 18:27:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:01,955 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-11-19 18:27:01,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-11-19 18:27:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 18:27:01,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:01,956 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:01,957 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:01,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:01,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-11-19 18:27:01,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:01,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734024309] [2019-11-19 18:27:01,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:27:02,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734024309] [2019-11-19 18:27:02,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:02,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:02,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804916755] [2019-11-19 18:27:02,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:02,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:02,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:02,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:02,008 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-11-19 18:27:02,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:02,298 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2019-11-19 18:27:02,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:02,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 18:27:02,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:02,300 INFO L225 Difference]: With dead ends: 324 [2019-11-19 18:27:02,300 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 18:27:02,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 18:27:02,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-19 18:27:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 18:27:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-19 18:27:02,309 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-11-19 18:27:02,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:02,309 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-19 18:27:02,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:02,309 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-19 18:27:02,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 18:27:02,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:02,311 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:02,311 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:02,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:02,311 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-11-19 18:27:02,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:02,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268323130] [2019-11-19 18:27:02,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:27:02,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268323130] [2019-11-19 18:27:02,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:02,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:02,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553140404] [2019-11-19 18:27:02,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:02,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:02,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:02,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:02,361 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-11-19 18:27:02,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:02,662 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2019-11-19 18:27:02,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:02,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 18:27:02,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:02,664 INFO L225 Difference]: With dead ends: 324 [2019-11-19 18:27:02,664 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 18:27:02,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 18:27:02,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-19 18:27:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 18:27:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-11-19 18:27:02,670 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-11-19 18:27:02,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:02,670 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-11-19 18:27:02,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-11-19 18:27:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-19 18:27:02,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:02,672 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:02,672 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:02,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:02,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-11-19 18:27:02,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:02,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471127762] [2019-11-19 18:27:02,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:27:02,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471127762] [2019-11-19 18:27:02,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:02,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:02,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380635158] [2019-11-19 18:27:02,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:02,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:02,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:02,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:02,727 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-11-19 18:27:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:03,009 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-11-19 18:27:03,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:03,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-19 18:27:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:03,011 INFO L225 Difference]: With dead ends: 324 [2019-11-19 18:27:03,011 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 18:27:03,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 18:27:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-19 18:27:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 18:27:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-11-19 18:27:03,017 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-11-19 18:27:03,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:03,017 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-11-19 18:27:03,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-11-19 18:27:03,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-19 18:27:03,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:03,018 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:03,019 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:03,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:03,019 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-11-19 18:27:03,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:03,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291713796] [2019-11-19 18:27:03,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:27:03,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291713796] [2019-11-19 18:27:03,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:03,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:03,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311049483] [2019-11-19 18:27:03,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:03,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:03,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:03,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:03,065 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-11-19 18:27:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:03,371 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2019-11-19 18:27:03,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:03,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-19 18:27:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:03,373 INFO L225 Difference]: With dead ends: 324 [2019-11-19 18:27:03,373 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 18:27:03,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 18:27:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-19 18:27:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 18:27:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-11-19 18:27:03,379 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-11-19 18:27:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:03,379 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-11-19 18:27:03,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-11-19 18:27:03,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-19 18:27:03,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:03,381 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:03,381 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:03,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:03,381 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-11-19 18:27:03,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:03,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844263514] [2019-11-19 18:27:03,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:27:03,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844263514] [2019-11-19 18:27:03,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:03,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:03,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614111548] [2019-11-19 18:27:03,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:03,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:03,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:03,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:03,426 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-11-19 18:27:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:03,735 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-11-19 18:27:03,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:03,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-19 18:27:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:03,738 INFO L225 Difference]: With dead ends: 314 [2019-11-19 18:27:03,738 INFO L226 Difference]: Without dead ends: 170 [2019-11-19 18:27:03,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-19 18:27:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2019-11-19 18:27:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 18:27:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-11-19 18:27:03,744 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-11-19 18:27:03,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:03,745 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-11-19 18:27:03,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:03,745 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-11-19 18:27:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 18:27:03,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:03,746 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:03,746 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:03,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:03,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1124223160, now seen corresponding path program 1 times [2019-11-19 18:27:03,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:03,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172476666] [2019-11-19 18:27:03,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:03,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172476666] [2019-11-19 18:27:03,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:03,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:03,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625886064] [2019-11-19 18:27:03,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:03,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:03,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:03,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:03,840 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-11-19 18:27:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:04,426 INFO L93 Difference]: Finished difference Result 402 states and 601 transitions. [2019-11-19 18:27:04,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:04,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-19 18:27:04,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:04,429 INFO L225 Difference]: With dead ends: 402 [2019-11-19 18:27:04,429 INFO L226 Difference]: Without dead ends: 258 [2019-11-19 18:27:04,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-19 18:27:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 206. [2019-11-19 18:27:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-19 18:27:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-11-19 18:27:04,442 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-11-19 18:27:04,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:04,443 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-11-19 18:27:04,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-11-19 18:27:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 18:27:04,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:04,446 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:04,446 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:04,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:04,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2021616438, now seen corresponding path program 1 times [2019-11-19 18:27:04,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:04,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555375637] [2019-11-19 18:27:04,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:04,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555375637] [2019-11-19 18:27:04,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:04,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:04,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287747512] [2019-11-19 18:27:04,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:04,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:04,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:04,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:04,545 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-11-19 18:27:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:05,030 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2019-11-19 18:27:05,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:05,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-19 18:27:05,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:05,034 INFO L225 Difference]: With dead ends: 442 [2019-11-19 18:27:05,034 INFO L226 Difference]: Without dead ends: 255 [2019-11-19 18:27:05,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-19 18:27:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-19 18:27:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 18:27:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-11-19 18:27:05,041 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-11-19 18:27:05,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:05,042 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-11-19 18:27:05,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:05,042 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-11-19 18:27:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 18:27:05,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:05,043 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:05,044 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:05,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:05,044 INFO L82 PathProgramCache]: Analyzing trace with hash -344765763, now seen corresponding path program 1 times [2019-11-19 18:27:05,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:05,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545573562] [2019-11-19 18:27:05,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:05,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545573562] [2019-11-19 18:27:05,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:05,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:05,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322454623] [2019-11-19 18:27:05,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:05,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:05,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:05,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:05,120 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-11-19 18:27:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:05,568 INFO L93 Difference]: Finished difference Result 493 states and 762 transitions. [2019-11-19 18:27:05,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:05,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-19 18:27:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:05,571 INFO L225 Difference]: With dead ends: 493 [2019-11-19 18:27:05,571 INFO L226 Difference]: Without dead ends: 282 [2019-11-19 18:27:05,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-19 18:27:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-11-19 18:27:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 18:27:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-11-19 18:27:05,578 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-11-19 18:27:05,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:05,578 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-11-19 18:27:05,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-11-19 18:27:05,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 18:27:05,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:05,580 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:05,580 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:05,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:05,580 INFO L82 PathProgramCache]: Analyzing trace with hash -304091013, now seen corresponding path program 1 times [2019-11-19 18:27:05,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:05,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135404326] [2019-11-19 18:27:05,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:05,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135404326] [2019-11-19 18:27:05,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:05,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:05,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507525931] [2019-11-19 18:27:05,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:05,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:05,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:05,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:05,660 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-11-19 18:27:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:05,992 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2019-11-19 18:27:05,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:05,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-19 18:27:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:05,995 INFO L225 Difference]: With dead ends: 466 [2019-11-19 18:27:05,995 INFO L226 Difference]: Without dead ends: 255 [2019-11-19 18:27:05,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-19 18:27:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-19 18:27:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 18:27:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-11-19 18:27:06,004 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-11-19 18:27:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:06,005 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-11-19 18:27:06,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-11-19 18:27:06,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 18:27:06,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:06,006 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:06,006 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:06,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:06,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1789653831, now seen corresponding path program 1 times [2019-11-19 18:27:06,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:06,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962194109] [2019-11-19 18:27:06,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:06,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962194109] [2019-11-19 18:27:06,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:06,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:06,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814143007] [2019-11-19 18:27:06,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:06,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:06,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:06,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:06,065 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-11-19 18:27:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:06,463 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2019-11-19 18:27:06,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:06,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 18:27:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:06,466 INFO L225 Difference]: With dead ends: 492 [2019-11-19 18:27:06,467 INFO L226 Difference]: Without dead ends: 281 [2019-11-19 18:27:06,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-19 18:27:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2019-11-19 18:27:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 18:27:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-11-19 18:27:06,473 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-11-19 18:27:06,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:06,473 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-11-19 18:27:06,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-11-19 18:27:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 18:27:06,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:06,475 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:06,475 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:06,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:06,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1162120014, now seen corresponding path program 1 times [2019-11-19 18:27:06,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:06,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775792760] [2019-11-19 18:27:06,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:06,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775792760] [2019-11-19 18:27:06,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:06,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:06,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070713631] [2019-11-19 18:27:06,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:06,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:06,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:06,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:06,536 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-11-19 18:27:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:06,987 INFO L93 Difference]: Finished difference Result 490 states and 753 transitions. [2019-11-19 18:27:06,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:06,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 18:27:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:06,989 INFO L225 Difference]: With dead ends: 490 [2019-11-19 18:27:06,989 INFO L226 Difference]: Without dead ends: 279 [2019-11-19 18:27:06,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-19 18:27:06,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-11-19 18:27:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 18:27:06,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-11-19 18:27:06,996 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-11-19 18:27:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:06,996 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-11-19 18:27:06,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-11-19 18:27:06,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 18:27:06,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:06,998 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:06,998 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:06,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:06,998 INFO L82 PathProgramCache]: Analyzing trace with hash -212771854, now seen corresponding path program 1 times [2019-11-19 18:27:06,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:06,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693636904] [2019-11-19 18:27:06,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:07,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693636904] [2019-11-19 18:27:07,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:07,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:07,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189502653] [2019-11-19 18:27:07,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:07,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:07,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:07,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:07,056 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-11-19 18:27:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:07,586 INFO L93 Difference]: Finished difference Result 489 states and 750 transitions. [2019-11-19 18:27:07,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:07,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 18:27:07,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:07,589 INFO L225 Difference]: With dead ends: 489 [2019-11-19 18:27:07,589 INFO L226 Difference]: Without dead ends: 278 [2019-11-19 18:27:07,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-19 18:27:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2019-11-19 18:27:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 18:27:07,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-11-19 18:27:07,599 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-11-19 18:27:07,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:07,599 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-11-19 18:27:07,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-11-19 18:27:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 18:27:07,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:07,601 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:07,601 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:07,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:07,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1667302693, now seen corresponding path program 1 times [2019-11-19 18:27:07,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:07,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544318522] [2019-11-19 18:27:07,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-19 18:27:07,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544318522] [2019-11-19 18:27:07,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:07,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:27:07,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222639705] [2019-11-19 18:27:07,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:27:07,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:07,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:27:07,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:07,696 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-11-19 18:27:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:08,167 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-11-19 18:27:08,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:27:08,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-19 18:27:08,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:08,170 INFO L225 Difference]: With dead ends: 462 [2019-11-19 18:27:08,170 INFO L226 Difference]: Without dead ends: 251 [2019-11-19 18:27:08,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:27:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-19 18:27:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-11-19 18:27:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 18:27:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-11-19 18:27:08,178 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-11-19 18:27:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:08,178 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-11-19 18:27:08,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:27:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-11-19 18:27:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 18:27:08,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:08,180 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:08,181 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:08,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash 98797236, now seen corresponding path program 1 times [2019-11-19 18:27:08,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:08,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55886665] [2019-11-19 18:27:08,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:08,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55886665] [2019-11-19 18:27:08,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:08,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:08,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326754314] [2019-11-19 18:27:08,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:08,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:08,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:08,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:08,292 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-11-19 18:27:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:08,626 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2019-11-19 18:27:08,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:08,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 18:27:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:08,629 INFO L225 Difference]: With dead ends: 503 [2019-11-19 18:27:08,629 INFO L226 Difference]: Without dead ends: 272 [2019-11-19 18:27:08,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:08,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-19 18:27:08,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-19 18:27:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 18:27:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-11-19 18:27:08,649 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-11-19 18:27:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:08,649 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-11-19 18:27:08,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-11-19 18:27:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 18:27:08,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:08,650 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:08,651 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:08,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:08,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1048145396, now seen corresponding path program 1 times [2019-11-19 18:27:08,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:08,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87404906] [2019-11-19 18:27:08,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:08,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87404906] [2019-11-19 18:27:08,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:08,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:08,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504104088] [2019-11-19 18:27:08,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:08,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:08,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:08,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:08,759 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-11-19 18:27:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:09,111 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2019-11-19 18:27:09,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:09,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 18:27:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:09,113 INFO L225 Difference]: With dead ends: 502 [2019-11-19 18:27:09,113 INFO L226 Difference]: Without dead ends: 271 [2019-11-19 18:27:09,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-19 18:27:09,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-19 18:27:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 18:27:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-11-19 18:27:09,121 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-11-19 18:27:09,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:09,121 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-11-19 18:27:09,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:09,121 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-11-19 18:27:09,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 18:27:09,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:09,123 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:09,123 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:09,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:09,123 INFO L82 PathProgramCache]: Analyzing trace with hash -645348551, now seen corresponding path program 1 times [2019-11-19 18:27:09,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:09,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851693591] [2019-11-19 18:27:09,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:09,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851693591] [2019-11-19 18:27:09,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:09,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:09,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789295420] [2019-11-19 18:27:09,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:09,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:09,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:09,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:09,177 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-11-19 18:27:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:09,664 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2019-11-19 18:27:09,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:09,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-19 18:27:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:09,667 INFO L225 Difference]: With dead ends: 529 [2019-11-19 18:27:09,667 INFO L226 Difference]: Without dead ends: 298 [2019-11-19 18:27:09,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-19 18:27:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-19 18:27:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 18:27:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-11-19 18:27:09,675 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-11-19 18:27:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:09,675 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-11-19 18:27:09,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:09,675 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-11-19 18:27:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 18:27:09,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:09,676 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:09,676 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:09,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:09,677 INFO L82 PathProgramCache]: Analyzing trace with hash -211619465, now seen corresponding path program 1 times [2019-11-19 18:27:09,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:09,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715625350] [2019-11-19 18:27:09,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:09,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715625350] [2019-11-19 18:27:09,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:09,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:09,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477462137] [2019-11-19 18:27:09,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:09,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:09,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:09,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:09,733 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-11-19 18:27:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:10,040 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2019-11-19 18:27:10,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:10,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-19 18:27:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:10,043 INFO L225 Difference]: With dead ends: 502 [2019-11-19 18:27:10,043 INFO L226 Difference]: Without dead ends: 271 [2019-11-19 18:27:10,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-19 18:27:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-19 18:27:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 18:27:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-11-19 18:27:10,051 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-11-19 18:27:10,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:10,051 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-11-19 18:27:10,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-11-19 18:27:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-19 18:27:10,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:10,052 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:10,053 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:10,053 INFO L82 PathProgramCache]: Analyzing trace with hash -300903122, now seen corresponding path program 1 times [2019-11-19 18:27:10,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:10,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671465483] [2019-11-19 18:27:10,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:10,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671465483] [2019-11-19 18:27:10,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:10,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:10,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084595822] [2019-11-19 18:27:10,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:10,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:10,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:10,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:10,109 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-11-19 18:27:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:10,501 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2019-11-19 18:27:10,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:10,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-19 18:27:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:10,503 INFO L225 Difference]: With dead ends: 529 [2019-11-19 18:27:10,503 INFO L226 Difference]: Without dead ends: 298 [2019-11-19 18:27:10,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-19 18:27:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-19 18:27:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 18:27:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-11-19 18:27:10,512 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-11-19 18:27:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:10,512 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-11-19 18:27:10,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-11-19 18:27:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-19 18:27:10,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:10,513 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:10,514 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash 259796656, now seen corresponding path program 1 times [2019-11-19 18:27:10,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:10,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190971096] [2019-11-19 18:27:10,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:10,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190971096] [2019-11-19 18:27:10,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:10,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:10,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392941025] [2019-11-19 18:27:10,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:10,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:10,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:10,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:10,564 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-11-19 18:27:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:10,906 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2019-11-19 18:27:10,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:10,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-19 18:27:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:10,908 INFO L225 Difference]: With dead ends: 502 [2019-11-19 18:27:10,908 INFO L226 Difference]: Without dead ends: 271 [2019-11-19 18:27:10,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-19 18:27:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-19 18:27:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 18:27:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-11-19 18:27:10,916 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-11-19 18:27:10,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:10,916 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-11-19 18:27:10,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-11-19 18:27:10,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 18:27:10,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:10,918 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:10,918 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:10,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:10,918 INFO L82 PathProgramCache]: Analyzing trace with hash 584269940, now seen corresponding path program 1 times [2019-11-19 18:27:10,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:10,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326958989] [2019-11-19 18:27:10,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:10,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326958989] [2019-11-19 18:27:10,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:10,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:10,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142566831] [2019-11-19 18:27:10,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:10,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:10,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:10,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:10,971 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-11-19 18:27:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:11,400 INFO L93 Difference]: Finished difference Result 529 states and 787 transitions. [2019-11-19 18:27:11,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:11,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-19 18:27:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:11,403 INFO L225 Difference]: With dead ends: 529 [2019-11-19 18:27:11,403 INFO L226 Difference]: Without dead ends: 298 [2019-11-19 18:27:11,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-19 18:27:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-19 18:27:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 18:27:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-11-19 18:27:11,412 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-11-19 18:27:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:11,412 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-11-19 18:27:11,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-11-19 18:27:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 18:27:11,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:11,413 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:11,413 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:11,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:11,414 INFO L82 PathProgramCache]: Analyzing trace with hash 786093874, now seen corresponding path program 1 times [2019-11-19 18:27:11,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:11,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499767488] [2019-11-19 18:27:11,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:11,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499767488] [2019-11-19 18:27:11,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:11,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:11,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719935284] [2019-11-19 18:27:11,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:11,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:11,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:11,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:11,467 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-11-19 18:27:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:11,791 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2019-11-19 18:27:11,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:11,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-19 18:27:11,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:11,793 INFO L225 Difference]: With dead ends: 502 [2019-11-19 18:27:11,793 INFO L226 Difference]: Without dead ends: 271 [2019-11-19 18:27:11,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-19 18:27:11,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-19 18:27:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 18:27:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-11-19 18:27:11,801 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-11-19 18:27:11,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:11,801 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-11-19 18:27:11,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-11-19 18:27:11,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-19 18:27:11,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:11,802 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:11,803 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:11,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:11,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1052130441, now seen corresponding path program 1 times [2019-11-19 18:27:11,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:11,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044839564] [2019-11-19 18:27:11,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:11,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044839564] [2019-11-19 18:27:11,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:11,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:11,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591925440] [2019-11-19 18:27:11,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:11,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:11,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:11,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:11,882 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-11-19 18:27:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:12,343 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2019-11-19 18:27:12,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:12,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-19 18:27:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:12,345 INFO L225 Difference]: With dead ends: 519 [2019-11-19 18:27:12,345 INFO L226 Difference]: Without dead ends: 288 [2019-11-19 18:27:12,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-19 18:27:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-11-19 18:27:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 18:27:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-11-19 18:27:12,354 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-11-19 18:27:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:12,354 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-11-19 18:27:12,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-11-19 18:27:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-19 18:27:12,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:12,356 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:12,356 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:12,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:12,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1281262197, now seen corresponding path program 1 times [2019-11-19 18:27:12,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:12,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381623855] [2019-11-19 18:27:12,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:12,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381623855] [2019-11-19 18:27:12,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:12,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:12,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156160831] [2019-11-19 18:27:12,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:12,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:12,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:12,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:12,418 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-11-19 18:27:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:12,704 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2019-11-19 18:27:12,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:12,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-19 18:27:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:12,707 INFO L225 Difference]: With dead ends: 492 [2019-11-19 18:27:12,707 INFO L226 Difference]: Without dead ends: 261 [2019-11-19 18:27:12,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-19 18:27:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2019-11-19 18:27:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 18:27:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-11-19 18:27:12,716 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-11-19 18:27:12,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:12,717 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-11-19 18:27:12,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-11-19 18:27:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-19 18:27:12,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:12,718 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:12,718 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:12,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:12,718 INFO L82 PathProgramCache]: Analyzing trace with hash -251052971, now seen corresponding path program 1 times [2019-11-19 18:27:12,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:12,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883598082] [2019-11-19 18:27:12,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:27:12,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883598082] [2019-11-19 18:27:12,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:12,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:27:12,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558171480] [2019-11-19 18:27:12,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:12,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:12,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:12,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:12,780 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-11-19 18:27:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:13,164 INFO L93 Difference]: Finished difference Result 519 states and 767 transitions. [2019-11-19 18:27:13,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:13,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-19 18:27:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:13,167 INFO L225 Difference]: With dead ends: 519 [2019-11-19 18:27:13,167 INFO L226 Difference]: Without dead ends: 288 [2019-11-19 18:27:13,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:27:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-19 18:27:13,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-11-19 18:27:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 18:27:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-11-19 18:27:13,175 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-11-19 18:27:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:13,175 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-11-19 18:27:13,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:13,175 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-11-19 18:27:13,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-19 18:27:13,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:13,177 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:13,177 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:13,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:13,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1937232809, now seen corresponding path program 1 times [2019-11-19 18:27:13,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:13,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167445641] [2019-11-19 18:27:13,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-19 18:27:13,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167445641] [2019-11-19 18:27:13,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:13,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:27:13,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429277316] [2019-11-19 18:27:13,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:27:13,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:27:13,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:27:13,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:27:13,243 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-11-19 18:27:13,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:13,273 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-11-19 18:27:13,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:27:13,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-19 18:27:13,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:13,276 INFO L225 Difference]: With dead ends: 710 [2019-11-19 18:27:13,276 INFO L226 Difference]: Without dead ends: 479 [2019-11-19 18:27:13,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:27:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-19 18:27:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-11-19 18:27:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-19 18:27:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-11-19 18:27:13,289 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-11-19 18:27:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:13,290 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-11-19 18:27:13,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:27:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-11-19 18:27:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-19 18:27:13,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:13,291 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:13,292 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:13,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:13,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-11-19 18:27:13,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:27:13,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884313824] [2019-11-19 18:27:13,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:27:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:27:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:27:13,583 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 18:27:13,583 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 18:27:13,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:27:13 BoogieIcfgContainer [2019-11-19 18:27:13,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:27:13,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:27:13,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:27:13,766 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:27:13,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:55" (3/4) ... [2019-11-19 18:27:13,772 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 18:27:13,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:27:13,777 INFO L168 Benchmark]: Toolchain (without parser) took 20181.58 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 377.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -140.7 MB). Peak memory consumption was 236.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:27:13,781 INFO L168 Benchmark]: CDTParser took 0.26 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-19 18:27:13,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 986.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -118.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-19 18:27:13,781 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:27:13,782 INFO L168 Benchmark]: Boogie Preprocessor took 91.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:27:13,782 INFO L168 Benchmark]: RCFGBuilder took 1189.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 968.6 MB in the end (delta: 97.8 MB). Peak memory consumption was 97.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:27:13,783 INFO L168 Benchmark]: TraceAbstraction took 17772.28 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 267.4 MB). Free memory was 968.6 MB in the beginning and 1.1 GB in the end (delta: -127.0 MB). Peak memory consumption was 140.3 MB. Max. memory is 11.5 GB. [2019-11-19 18:27:13,783 INFO L168 Benchmark]: Witness Printer took 7.10 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:27:13,785 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 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 986.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -118.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 126.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1189.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 968.6 MB in the end (delta: 97.8 MB). Peak memory consumption was 97.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17772.28 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 267.4 MB). Free memory was 968.6 MB in the beginning and 1.1 GB in the end (delta: -127.0 MB). Peak memory consumption was 140.3 MB. Max. memory is 11.5 GB. * Witness Printer took 7.10 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-9:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-9:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-9:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-9:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-9:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-9:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-9:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-9:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1229] COND TRUE s->state == 8656 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={-9:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={-9:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-9:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-9:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 17.6s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7075 SDtfs, 2083 SDslu, 10603 SDs, 0 SdLazy, 6863 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 76 SyntacticMatches, 29 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 914 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 733119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 1564/1564 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:27:15,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:27:15,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:27:15,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:27:15,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:27:15,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:27:15,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:27:15,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:27:15,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:27:15,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:27:15,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:27:15,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:27:15,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:27:15,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:27:15,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:27:15,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:27:15,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:27:15,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:27:15,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:27:15,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:27:15,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:27:15,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:27:15,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:27:15,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:27:15,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:27:15,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:27:15,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:27:15,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:27:15,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:27:15,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:27:15,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:27:15,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:27:15,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:27:15,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:27:15,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:27:15,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:27:15,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:27:15,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:27:15,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:27:15,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:27:15,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:27:15,765 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 18:27:15,785 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:27:15,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:27:15,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:27:15,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:27:15,787 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:27:15,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:27:15,788 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:27:15,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:27:15,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:27:15,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:27:15,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:27:15,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:27:15,791 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 18:27:15,791 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 18:27:15,791 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:27:15,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:27:15,792 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:27:15,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:27:15,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:27:15,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:27:15,793 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:27:15,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:27:15,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:27:15,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:27:15,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:27:15,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:27:15,795 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 18:27:15,795 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 18:27:15,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:27:15,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 18:27:15,796 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 ! call(__VERIFIER_error())) ) 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 -> a85198d3f93b8c751f2c6e712deab62f97c1022f [2019-11-19 18:27:16,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:27:16,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:27:16,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:27:16,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:27:16,103 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:27:16,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-19 18:27:16,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcdf3f16a/2a8344d15e9f4f28b2b39ab1ec3b8552/FLAG252f1fc2e [2019-11-19 18:27:16,776 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:27:16,777 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-19 18:27:16,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcdf3f16a/2a8344d15e9f4f28b2b39ab1ec3b8552/FLAG252f1fc2e [2019-11-19 18:27:17,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcdf3f16a/2a8344d15e9f4f28b2b39ab1ec3b8552 [2019-11-19 18:27:17,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:27:17,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:27:17,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:27:17,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:27:17,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:27:17,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:27:17" (1/1) ... [2019-11-19 18:27:17,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2141d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:27:17, skipping insertion in model container [2019-11-19 18:27:17,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:27:17" (1/1) ... [2019-11-19 18:27:17,026 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:27:17,103 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:27:17,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:27:17,686 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:27:17,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:27:17,890 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:27:17,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:27:17 WrapperNode [2019-11-19 18:27:17,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:27:17,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:27:17,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:27:17,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:27:17,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:27:17" (1/1) ... [2019-11-19 18:27:17,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:27:17" (1/1) ... [2019-11-19 18:27:17,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:27:17,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:27:17,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:27:17,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:27:17,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:27:17" (1/1) ... [2019-11-19 18:27:17,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:27:17" (1/1) ... [2019-11-19 18:27:18,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:27:17" (1/1) ... [2019-11-19 18:27:18,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:27:17" (1/1) ... [2019-11-19 18:27:18,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:27:17" (1/1) ... [2019-11-19 18:27:18,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:27:17" (1/1) ... [2019-11-19 18:27:18,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:27:17" (1/1) ... [2019-11-19 18:27:18,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:27:18,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:27:18,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:27:18,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:27:18,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:27:17" (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-19 18:27:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 18:27:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 18:27:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 18:27:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 18:27:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 18:27:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:27:18,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:27:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 18:27:18,472 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 18:27:21,227 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-19 18:27:21,227 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-19 18:27:21,229 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:27:21,229 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 18:27:21,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:27:21 BoogieIcfgContainer [2019-11-19 18:27:21,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:27:21,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:27:21,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:27:21,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:27:21,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:27:17" (1/3) ... [2019-11-19 18:27:21,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a576e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:27:21, skipping insertion in model container [2019-11-19 18:27:21,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:27:17" (2/3) ... [2019-11-19 18:27:21,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a576e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:27:21, skipping insertion in model container [2019-11-19 18:27:21,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:27:21" (3/3) ... [2019-11-19 18:27:21,239 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-11-19 18:27:21,247 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:27:21,253 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:27:21,261 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:27:21,285 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:27:21,286 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:27:21,286 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:27:21,286 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:27:21,286 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:27:21,286 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:27:21,286 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:27:21,287 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:27:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-19 18:27:21,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 18:27:21,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:21,318 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-19 18:27:21,319 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:21,324 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-19 18:27:21,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:27:21,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1925762984] [2019-11-19 18:27:21,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 18:27:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:21,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 18:27:21,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:27:21,653 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-19 18:27:21,653 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:27:21,691 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-19 18:27:21,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1925762984] [2019-11-19 18:27:21,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:21,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 18:27:21,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280939315] [2019-11-19 18:27:21,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:21,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:27:21,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:21,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:21,720 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-19 18:27:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:21,862 INFO L93 Difference]: Finished difference Result 540 states and 917 transitions. [2019-11-19 18:27:21,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:21,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-19 18:27:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:21,882 INFO L225 Difference]: With dead ends: 540 [2019-11-19 18:27:21,883 INFO L226 Difference]: Without dead ends: 366 [2019-11-19 18:27:21,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:21,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-19 18:27:21,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2019-11-19 18:27:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-19 18:27:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 556 transitions. [2019-11-19 18:27:21,971 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 556 transitions. Word has length 45 [2019-11-19 18:27:21,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:21,972 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 556 transitions. [2019-11-19 18:27:21,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 556 transitions. [2019-11-19 18:27:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-19 18:27:21,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:21,979 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-19 18:27:22,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 18:27:22,182 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:22,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:22,183 INFO L82 PathProgramCache]: Analyzing trace with hash 577204179, now seen corresponding path program 1 times [2019-11-19 18:27:22,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:27:22,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [195290510] [2019-11-19 18:27:22,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 18:27:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:27:22,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 18:27:22,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:27:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:27:22,520 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:27:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:27:22,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [195290510] [2019-11-19 18:27:22,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:27:22,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 18:27:22,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892807513] [2019-11-19 18:27:22,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:27:22,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:27:22,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:27:22,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:22,567 INFO L87 Difference]: Start difference. First operand 366 states and 556 transitions. Second operand 4 states. [2019-11-19 18:27:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:27:22,820 INFO L93 Difference]: Finished difference Result 839 states and 1282 transitions. [2019-11-19 18:27:22,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:27:22,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-19 18:27:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:27:22,827 INFO L225 Difference]: With dead ends: 839 [2019-11-19 18:27:22,827 INFO L226 Difference]: Without dead ends: 600 [2019-11-19 18:27:22,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:27:22,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-11-19 18:27:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-11-19 18:27:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-19 18:27:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-11-19 18:27:22,914 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 103 [2019-11-19 18:27:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:27:22,916 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-11-19 18:27:22,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:27:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-11-19 18:27:22,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-19 18:27:22,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:27:22,936 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:27:23,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 18:27:23,149 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:27:23,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:27:23,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-11-19 18:27:23,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:27:23,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1932235874] [2019-11-19 18:27:23,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 18:27:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:27:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:27:25,449 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-19 18:27:25,449 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 18:27:25,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 18:27:25,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:27:25 BoogieIcfgContainer [2019-11-19 18:27:25,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:27:25,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:27:25,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:27:25,792 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:27:25,793 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:27:21" (3/4) ... [2019-11-19 18:27:25,795 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 18:27:25,931 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:27:25,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:27:25,934 INFO L168 Benchmark]: Toolchain (without parser) took 8924.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2019-11-19 18:27:25,935 INFO L168 Benchmark]: CDTParser took 0.28 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-19 18:27:25,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 880.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-11-19 18:27:25,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.28 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:27:25,936 INFO L168 Benchmark]: Boogie Preprocessor took 117.79 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:27:25,937 INFO L168 Benchmark]: RCFGBuilder took 3127.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.3 MB). Peak memory consumption was 98.3 MB. Max. memory is 11.5 GB. [2019-11-19 18:27:25,937 INFO L168 Benchmark]: TraceAbstraction took 4559.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -134.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:27:25,938 INFO L168 Benchmark]: Witness Printer took 140.31 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-11-19 18:27:25,940 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 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 880.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.28 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.79 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3127.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.3 MB). Peak memory consumption was 98.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4559.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -134.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 140.31 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1702]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1229] COND TRUE s->state == 8656 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-1476592689:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.5s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 587 SDtfs, 659 SDslu, 792 SDs, 0 SdLazy, 51 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 74336 SizeOfPredicates, 1 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 116/116 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 incorrect! Received shutdown request...