./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh/s3_srvr.blast.01_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/ssh/s3_srvr.blast.01_false-unreach-call.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 9c69768cb083538b139479bdbb35676eb3378c1b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: 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 /storage/repos/svcomp/c/ssh/s3_srvr.blast.01_false-unreach-call.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 9c69768cb083538b139479bdbb35676eb3378c1b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-0ed9222-m [2019-01-14 15:07:50,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:07:50,607 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:07:50,623 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:07:50,624 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:07:50,626 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:07:50,628 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:07:50,638 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:07:50,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:07:50,648 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:07:50,650 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:07:50,652 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:07:50,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:07:50,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:07:50,657 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:07:50,658 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:07:50,659 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:07:50,664 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:07:50,666 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:07:50,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:07:50,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:07:50,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:07:50,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:07:50,673 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:07:50,673 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:07:50,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:07:50,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:07:50,676 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:07:50,676 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:07:50,677 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:07:50,677 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:07:50,678 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:07:50,679 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:07:50,679 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:07:50,680 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:07:50,680 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:07:50,681 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:07:50,695 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:07:50,696 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:07:50,697 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:07:50,697 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:07:50,697 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:07:50,697 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:07:50,698 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:07:50,698 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:07:50,698 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:07:50,698 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:07:50,698 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:07:50,699 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:07:50,699 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:07:50,699 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:07:50,699 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:07:50,699 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:07:50,699 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:07:50,700 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:07:50,701 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:07:50,701 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:07:50,701 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:07:50,701 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:07:50,701 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:07:50,701 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:07:50,702 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:07:50,702 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:07:50,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:07:50,702 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 9c69768cb083538b139479bdbb35676eb3378c1b [2019-01-14 15:07:50,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:07:50,767 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:07:50,771 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:07:50,773 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:07:50,773 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:07:50,774 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh/s3_srvr.blast.01_false-unreach-call.i.cil.c [2019-01-14 15:07:50,838 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b125401/a396f263c3534fc78890473aa2ae3f5c/FLAG4ce6b45e1 [2019-01-14 15:07:51,416 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:07:51,417 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh/s3_srvr.blast.01_false-unreach-call.i.cil.c [2019-01-14 15:07:51,436 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b125401/a396f263c3534fc78890473aa2ae3f5c/FLAG4ce6b45e1 [2019-01-14 15:07:51,663 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b125401/a396f263c3534fc78890473aa2ae3f5c [2019-01-14 15:07:51,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:07:51,669 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:07:51,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:07:51,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:07:51,674 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:07:51,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:07:51" (1/1) ... [2019-01-14 15:07:51,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b5ba7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:51, skipping insertion in model container [2019-01-14 15:07:51,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:07:51" (1/1) ... [2019-01-14 15:07:51,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:07:51,785 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:07:52,292 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:07:52,314 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:07:52,546 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:07:52,573 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:07:52,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:52 WrapperNode [2019-01-14 15:07:52,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:07:52,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:07:52,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:07:52,574 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:07:52,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:52" (1/1) ... [2019-01-14 15:07:52,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:52" (1/1) ... [2019-01-14 15:07:52,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:07:52,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:07:52,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:07:52,683 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:07:52,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:52" (1/1) ... [2019-01-14 15:07:52,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:52" (1/1) ... [2019-01-14 15:07:52,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:52" (1/1) ... [2019-01-14 15:07:52,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:52" (1/1) ... [2019-01-14 15:07:52,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:52" (1/1) ... [2019-01-14 15:07:52,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:52" (1/1) ... [2019-01-14 15:07:52,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:52" (1/1) ... [2019-01-14 15:07:52,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:07:52,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:07:52,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:07:52,814 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:07:52,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:52" (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-01-14 15:07:52,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 15:07:52,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:07:52,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:07:52,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 15:07:52,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 15:07:52,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:07:52,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 15:07:52,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:07:52,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:07:52,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:07:53,222 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 15:07:55,228 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-01-14 15:07:55,228 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-01-14 15:07:55,230 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:07:55,230 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 15:07:55,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:55 BoogieIcfgContainer [2019-01-14 15:07:55,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:07:55,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:07:55,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:07:55,236 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:07:55,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:07:51" (1/3) ... [2019-01-14 15:07:55,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c62c1b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:07:55, skipping insertion in model container [2019-01-14 15:07:55,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:52" (2/3) ... [2019-01-14 15:07:55,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c62c1b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:07:55, skipping insertion in model container [2019-01-14 15:07:55,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:55" (3/3) ... [2019-01-14 15:07:55,240 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01_false-unreach-call.i.cil.c [2019-01-14 15:07:55,252 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:07:55,262 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:07:55,280 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:07:55,309 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:07:55,310 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:07:55,310 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:07:55,310 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:07:55,310 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:07:55,310 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:07:55,311 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:07:55,311 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:07:55,311 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:07:55,330 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-01-14 15:07:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 15:07:55,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:55,341 INFO L402 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-01-14 15:07:55,343 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2019-01-14 15:07:55,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:55,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:55,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:55,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:55,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:55,845 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-14 15:07:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:07:56,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:56,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:56,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:56,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:56,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:56,063 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-01-14 15:07:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:57,120 INFO L93 Difference]: Finished difference Result 317 states and 530 transitions. [2019-01-14 15:07:57,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:57,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-01-14 15:07:57,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:57,138 INFO L225 Difference]: With dead ends: 317 [2019-01-14 15:07:57,139 INFO L226 Difference]: Without dead ends: 160 [2019-01-14 15:07:57,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:07:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-14 15:07:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-01-14 15:07:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-14 15:07:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2019-01-14 15:07:57,199 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 45 [2019-01-14 15:07:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:57,200 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2019-01-14 15:07:57,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2019-01-14 15:07:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 15:07:57,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:57,209 INFO L402 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-01-14 15:07:57,209 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:57,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:57,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1923702817, now seen corresponding path program 1 times [2019-01-14 15:07:57,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:57,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:57,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:57,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:57,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:07:57,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:57,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:57,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:57,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:57,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:57,371 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand 4 states. [2019-01-14 15:07:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:57,845 INFO L93 Difference]: Finished difference Result 284 states and 429 transitions. [2019-01-14 15:07:57,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:57,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-01-14 15:07:57,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:57,849 INFO L225 Difference]: With dead ends: 284 [2019-01-14 15:07:57,849 INFO L226 Difference]: Without dead ends: 160 [2019-01-14 15:07:57,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:07:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-14 15:07:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-01-14 15:07:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-14 15:07:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2019-01-14 15:07:57,864 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 58 [2019-01-14 15:07:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:57,864 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2019-01-14 15:07:57,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:57,865 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2019-01-14 15:07:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-14 15:07:57,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:57,867 INFO L402 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-01-14 15:07:57,867 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:57,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:57,868 INFO L82 PathProgramCache]: Analyzing trace with hash -2009873572, now seen corresponding path program 1 times [2019-01-14 15:07:57,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:57,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:57,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:57,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:57,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:07:58,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:58,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:58,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:58,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:58,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:58,111 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand 4 states. [2019-01-14 15:07:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:58,514 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2019-01-14 15:07:58,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:58,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-01-14 15:07:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:58,519 INFO L225 Difference]: With dead ends: 282 [2019-01-14 15:07:58,520 INFO L226 Difference]: Without dead ends: 158 [2019-01-14 15:07:58,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:07:58,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-14 15:07:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2019-01-14 15:07:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-14 15:07:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2019-01-14 15:07:58,532 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 59 [2019-01-14 15:07:58,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:58,532 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2019-01-14 15:07:58,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2019-01-14 15:07:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-14 15:07:58,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:58,535 INFO L402 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-01-14 15:07:58,535 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:58,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:58,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1439655328, now seen corresponding path program 1 times [2019-01-14 15:07:58,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:58,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:58,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:58,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:58,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:07:58,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:58,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:58,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:58,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:58,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:58,741 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand 4 states. [2019-01-14 15:07:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:59,614 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2019-01-14 15:07:59,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:59,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-01-14 15:07:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:59,617 INFO L225 Difference]: With dead ends: 281 [2019-01-14 15:07:59,617 INFO L226 Difference]: Without dead ends: 157 [2019-01-14 15:07:59,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:07:59,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-14 15:07:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2019-01-14 15:07:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-14 15:07:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2019-01-14 15:07:59,629 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 59 [2019-01-14 15:07:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:59,629 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2019-01-14 15:07:59,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2019-01-14 15:07:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-14 15:07:59,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:59,633 INFO L402 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, 1] [2019-01-14 15:07:59,633 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:59,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:59,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1630534542, now seen corresponding path program 1 times [2019-01-14 15:07:59,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:59,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:59,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:59,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:07:59,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:59,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:59,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:59,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:59,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:59,789 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand 4 states. [2019-01-14 15:08:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:00,196 INFO L93 Difference]: Finished difference Result 280 states and 422 transitions. [2019-01-14 15:08:00,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:00,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-01-14 15:08:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:00,200 INFO L225 Difference]: With dead ends: 280 [2019-01-14 15:08:00,200 INFO L226 Difference]: Without dead ends: 156 [2019-01-14 15:08:00,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-14 15:08:00,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-01-14 15:08:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-14 15:08:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2019-01-14 15:08:00,208 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 60 [2019-01-14 15:08:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:00,208 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2019-01-14 15:08:00,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2019-01-14 15:08:00,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-14 15:08:00,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:00,210 INFO L402 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, 1] [2019-01-14 15:08:00,210 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:00,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:00,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1839064698, now seen corresponding path program 1 times [2019-01-14 15:08:00,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:00,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:00,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:00,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:00,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:00,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:00,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:00,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:00,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:00,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:00,566 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand 4 states. [2019-01-14 15:08:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:01,124 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2019-01-14 15:08:01,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:01,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-01-14 15:08:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:01,127 INFO L225 Difference]: With dead ends: 280 [2019-01-14 15:08:01,127 INFO L226 Difference]: Without dead ends: 156 [2019-01-14 15:08:01,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-14 15:08:01,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-01-14 15:08:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-14 15:08:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2019-01-14 15:08:01,134 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 60 [2019-01-14 15:08:01,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:01,135 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2019-01-14 15:08:01,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2019-01-14 15:08:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 15:08:01,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:01,137 INFO L402 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, 1] [2019-01-14 15:08:01,137 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:01,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:01,137 INFO L82 PathProgramCache]: Analyzing trace with hash 476213239, now seen corresponding path program 1 times [2019-01-14 15:08:01,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:01,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:01,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:01,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:01,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:01,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:01,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:01,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:01,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:01,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:01,218 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand 4 states. [2019-01-14 15:08:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:01,576 INFO L93 Difference]: Finished difference Result 280 states and 420 transitions. [2019-01-14 15:08:01,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:01,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-01-14 15:08:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:01,579 INFO L225 Difference]: With dead ends: 280 [2019-01-14 15:08:01,579 INFO L226 Difference]: Without dead ends: 156 [2019-01-14 15:08:01,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-14 15:08:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-01-14 15:08:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-14 15:08:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2019-01-14 15:08:01,587 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 61 [2019-01-14 15:08:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:01,588 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2019-01-14 15:08:01,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:01,588 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2019-01-14 15:08:01,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 15:08:01,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:01,589 INFO L402 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, 1] [2019-01-14 15:08:01,589 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:01,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:01,589 INFO L82 PathProgramCache]: Analyzing trace with hash -25209675, now seen corresponding path program 1 times [2019-01-14 15:08:01,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:01,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:01,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:01,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:01,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:01,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:01,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:01,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:01,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:01,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:01,826 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand 4 states. [2019-01-14 15:08:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:02,147 INFO L93 Difference]: Finished difference Result 280 states and 419 transitions. [2019-01-14 15:08:02,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:02,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-01-14 15:08:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:02,150 INFO L225 Difference]: With dead ends: 280 [2019-01-14 15:08:02,150 INFO L226 Difference]: Without dead ends: 156 [2019-01-14 15:08:02,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:02,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-14 15:08:02,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-01-14 15:08:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-14 15:08:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2019-01-14 15:08:02,160 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 62 [2019-01-14 15:08:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:02,161 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2019-01-14 15:08:02,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2019-01-14 15:08:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 15:08:02,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:02,162 INFO L402 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-01-14 15:08:02,162 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:02,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:02,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1383513241, now seen corresponding path program 1 times [2019-01-14 15:08:02,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:02,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:02,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:02,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:02,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:02,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:02,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:02,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:02,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:02,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:02,396 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand 4 states. [2019-01-14 15:08:02,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:02,804 INFO L93 Difference]: Finished difference Result 310 states and 467 transitions. [2019-01-14 15:08:02,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:02,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-01-14 15:08:02,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:02,807 INFO L225 Difference]: With dead ends: 310 [2019-01-14 15:08:02,807 INFO L226 Difference]: Without dead ends: 186 [2019-01-14 15:08:02,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:02,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-14 15:08:02,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-01-14 15:08:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-14 15:08:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2019-01-14 15:08:02,814 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 62 [2019-01-14 15:08:02,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:02,814 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2019-01-14 15:08:02,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2019-01-14 15:08:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 15:08:02,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:02,815 INFO L402 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, 1] [2019-01-14 15:08:02,815 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:02,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:02,816 INFO L82 PathProgramCache]: Analyzing trace with hash 407848530, now seen corresponding path program 1 times [2019-01-14 15:08:02,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:02,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:02,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:02,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:02,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:03,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:03,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:03,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:03,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:03,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:03,085 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand 4 states. [2019-01-14 15:08:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:03,691 INFO L93 Difference]: Finished difference Result 314 states and 481 transitions. [2019-01-14 15:08:03,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:03,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-01-14 15:08:03,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:03,695 INFO L225 Difference]: With dead ends: 314 [2019-01-14 15:08:03,695 INFO L226 Difference]: Without dead ends: 168 [2019-01-14 15:08:03,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-14 15:08:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2019-01-14 15:08:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-14 15:08:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2019-01-14 15:08:03,703 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 63 [2019-01-14 15:08:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:03,704 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2019-01-14 15:08:03,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2019-01-14 15:08:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-14 15:08:03,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:03,705 INFO L402 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-01-14 15:08:03,705 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:03,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1281685867, now seen corresponding path program 1 times [2019-01-14 15:08:03,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:03,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:03,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:03,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:03,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:03,853 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:03,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:03,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:03,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:03,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:03,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:03,854 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand 4 states. [2019-01-14 15:08:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:04,318 INFO L93 Difference]: Finished difference Result 332 states and 503 transitions. [2019-01-14 15:08:04,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:04,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-01-14 15:08:04,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:04,321 INFO L225 Difference]: With dead ends: 332 [2019-01-14 15:08:04,321 INFO L226 Difference]: Without dead ends: 186 [2019-01-14 15:08:04,322 INFO L631 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-01-14 15:08:04,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-14 15:08:04,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-01-14 15:08:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-14 15:08:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2019-01-14 15:08:04,329 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 75 [2019-01-14 15:08:04,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:04,329 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2019-01-14 15:08:04,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2019-01-14 15:08:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-14 15:08:04,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:04,332 INFO L402 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-01-14 15:08:04,332 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash 712782694, now seen corresponding path program 1 times [2019-01-14 15:08:04,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:04,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:04,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:04,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:04,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:04,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:04,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:04,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:04,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:04,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:04,459 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand 4 states. [2019-01-14 15:08:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:05,609 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2019-01-14 15:08:05,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:05,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-01-14 15:08:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:05,612 INFO L225 Difference]: With dead ends: 330 [2019-01-14 15:08:05,613 INFO L226 Difference]: Without dead ends: 184 [2019-01-14 15:08:05,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-14 15:08:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2019-01-14 15:08:05,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-14 15:08:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2019-01-14 15:08:05,619 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 76 [2019-01-14 15:08:05,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:05,619 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2019-01-14 15:08:05,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:05,619 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2019-01-14 15:08:05,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-14 15:08:05,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:05,620 INFO L402 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-01-14 15:08:05,620 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:05,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:05,621 INFO L82 PathProgramCache]: Analyzing trace with hash -132655702, now seen corresponding path program 1 times [2019-01-14 15:08:05,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:05,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:05,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:05,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:05,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:05,763 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:05,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:05,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:05,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:05,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:05,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:05,764 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand 4 states. [2019-01-14 15:08:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:06,210 INFO L93 Difference]: Finished difference Result 329 states and 496 transitions. [2019-01-14 15:08:06,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:06,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-01-14 15:08:06,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:06,213 INFO L225 Difference]: With dead ends: 329 [2019-01-14 15:08:06,214 INFO L226 Difference]: Without dead ends: 183 [2019-01-14 15:08:06,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-14 15:08:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2019-01-14 15:08:06,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-14 15:08:06,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2019-01-14 15:08:06,220 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 76 [2019-01-14 15:08:06,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:06,220 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2019-01-14 15:08:06,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:06,220 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2019-01-14 15:08:06,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 15:08:06,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:06,221 INFO L402 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, 1] [2019-01-14 15:08:06,221 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:06,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:06,222 INFO L82 PathProgramCache]: Analyzing trace with hash 133532868, now seen corresponding path program 1 times [2019-01-14 15:08:06,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:06,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:06,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:06,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:06,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:06,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:06,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:06,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:06,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:06,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:06,496 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand 4 states. [2019-01-14 15:08:07,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:07,092 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2019-01-14 15:08:07,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:07,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-01-14 15:08:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:07,097 INFO L225 Difference]: With dead ends: 328 [2019-01-14 15:08:07,097 INFO L226 Difference]: Without dead ends: 182 [2019-01-14 15:08:07,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:07,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-14 15:08:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-01-14 15:08:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-14 15:08:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2019-01-14 15:08:07,102 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 77 [2019-01-14 15:08:07,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:07,102 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2019-01-14 15:08:07,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2019-01-14 15:08:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 15:08:07,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:07,103 INFO L402 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, 1] [2019-01-14 15:08:07,104 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:07,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:07,104 INFO L82 PathProgramCache]: Analyzing trace with hash 342063024, now seen corresponding path program 1 times [2019-01-14 15:08:07,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:07,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:07,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:07,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:07,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:07,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:07,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:07,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:07,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:07,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:07,260 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand 4 states. [2019-01-14 15:08:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:07,593 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2019-01-14 15:08:07,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:07,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-01-14 15:08:07,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:07,596 INFO L225 Difference]: With dead ends: 328 [2019-01-14 15:08:07,596 INFO L226 Difference]: Without dead ends: 182 [2019-01-14 15:08:07,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:07,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-14 15:08:07,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-01-14 15:08:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-14 15:08:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2019-01-14 15:08:07,603 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 77 [2019-01-14 15:08:07,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:07,603 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2019-01-14 15:08:07,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2019-01-14 15:08:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-14 15:08:07,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:07,604 INFO L402 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, 1] [2019-01-14 15:08:07,605 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:07,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1313801601, now seen corresponding path program 1 times [2019-01-14 15:08:07,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:07,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:07,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:07,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:07,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:07,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:07,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:07,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:07,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:07,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:07,883 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand 4 states. [2019-01-14 15:08:08,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:08,183 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2019-01-14 15:08:08,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:08,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-01-14 15:08:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:08,186 INFO L225 Difference]: With dead ends: 328 [2019-01-14 15:08:08,186 INFO L226 Difference]: Without dead ends: 182 [2019-01-14 15:08:08,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-14 15:08:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-01-14 15:08:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-14 15:08:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2019-01-14 15:08:08,191 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 78 [2019-01-14 15:08:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:08,192 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2019-01-14 15:08:08,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2019-01-14 15:08:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 15:08:08,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:08,193 INFO L402 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, 1] [2019-01-14 15:08:08,193 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:08,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:08,193 INFO L82 PathProgramCache]: Analyzing trace with hash 170225771, now seen corresponding path program 1 times [2019-01-14 15:08:08,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:08,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:08,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:08,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:08,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:08,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:08,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:08,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:08,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:08,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:08,395 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand 4 states. [2019-01-14 15:08:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:08,674 INFO L93 Difference]: Finished difference Result 328 states and 487 transitions. [2019-01-14 15:08:08,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:08,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-01-14 15:08:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:08,677 INFO L225 Difference]: With dead ends: 328 [2019-01-14 15:08:08,677 INFO L226 Difference]: Without dead ends: 182 [2019-01-14 15:08:08,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-14 15:08:08,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-01-14 15:08:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-14 15:08:08,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2019-01-14 15:08:08,683 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 79 [2019-01-14 15:08:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:08,688 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2019-01-14 15:08:08,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2019-01-14 15:08:08,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-14 15:08:08,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:08,689 INFO L402 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, 1] [2019-01-14 15:08:08,689 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:08,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2123587236, now seen corresponding path program 1 times [2019-01-14 15:08:08,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:08,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:08,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:08,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:08,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:08,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:08,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:08,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:08,906 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand 4 states. [2019-01-14 15:08:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:09,209 INFO L93 Difference]: Finished difference Result 318 states and 472 transitions. [2019-01-14 15:08:09,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:09,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-01-14 15:08:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:09,212 INFO L225 Difference]: With dead ends: 318 [2019-01-14 15:08:09,212 INFO L226 Difference]: Without dead ends: 172 [2019-01-14 15:08:09,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:09,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-01-14 15:08:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2019-01-14 15:08:09,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-14 15:08:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2019-01-14 15:08:09,218 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 80 [2019-01-14 15:08:09,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:09,218 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2019-01-14 15:08:09,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2019-01-14 15:08:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 15:08:09,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:09,219 INFO L402 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-01-14 15:08:09,219 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:09,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:09,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1575477095, now seen corresponding path program 1 times [2019-01-14 15:08:09,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:09,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:09,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:09,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:09,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:09,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:09,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:09,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:09,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:09,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:09,556 INFO L87 Difference]: Start difference. First operand 165 states and 241 transitions. Second operand 4 states. [2019-01-14 15:08:10,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:10,147 INFO L93 Difference]: Finished difference Result 408 states and 610 transitions. [2019-01-14 15:08:10,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:10,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-01-14 15:08:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:10,151 INFO L225 Difference]: With dead ends: 408 [2019-01-14 15:08:10,151 INFO L226 Difference]: Without dead ends: 262 [2019-01-14 15:08:10,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:10,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-01-14 15:08:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2019-01-14 15:08:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-01-14 15:08:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2019-01-14 15:08:10,158 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 84 [2019-01-14 15:08:10,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:10,159 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2019-01-14 15:08:10,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2019-01-14 15:08:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 15:08:10,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:10,160 INFO L402 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-01-14 15:08:10,160 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:10,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:10,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1822096923, now seen corresponding path program 1 times [2019-01-14 15:08:10,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:10,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:10,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:10,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:10,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:10,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:10,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:10,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:10,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:10,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:10,273 INFO L87 Difference]: Start difference. First operand 208 states and 319 transitions. Second operand 4 states. [2019-01-14 15:08:10,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:10,598 INFO L93 Difference]: Finished difference Result 446 states and 691 transitions. [2019-01-14 15:08:10,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:10,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-01-14 15:08:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:10,601 INFO L225 Difference]: With dead ends: 446 [2019-01-14 15:08:10,601 INFO L226 Difference]: Without dead ends: 257 [2019-01-14 15:08:10,601 INFO L631 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-01-14 15:08:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-01-14 15:08:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-01-14 15:08:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-14 15:08:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2019-01-14 15:08:10,606 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 84 [2019-01-14 15:08:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:10,607 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2019-01-14 15:08:10,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2019-01-14 15:08:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-14 15:08:10,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:10,608 INFO L402 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-01-14 15:08:10,608 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:10,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:10,608 INFO L82 PathProgramCache]: Analyzing trace with hash 878453397, now seen corresponding path program 1 times [2019-01-14 15:08:10,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:10,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:10,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:10,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:10,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:10,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:10,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:10,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:10,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:10,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:10,744 INFO L87 Difference]: Start difference. First operand 232 states and 361 transitions. Second operand 4 states. [2019-01-14 15:08:11,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:11,161 INFO L93 Difference]: Finished difference Result 499 states and 771 transitions. [2019-01-14 15:08:11,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:11,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-01-14 15:08:11,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:11,165 INFO L225 Difference]: With dead ends: 499 [2019-01-14 15:08:11,165 INFO L226 Difference]: Without dead ends: 286 [2019-01-14 15:08:11,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-14 15:08:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2019-01-14 15:08:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-14 15:08:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2019-01-14 15:08:11,171 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 97 [2019-01-14 15:08:11,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:11,172 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2019-01-14 15:08:11,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2019-01-14 15:08:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-14 15:08:11,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:11,173 INFO L402 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-01-14 15:08:11,173 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:11,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:11,173 INFO L82 PathProgramCache]: Analyzing trace with hash 919128147, now seen corresponding path program 1 times [2019-01-14 15:08:11,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:11,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:11,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:11,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:11,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:11,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:11,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:11,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:11,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:11,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:11,519 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand 4 states. [2019-01-14 15:08:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:11,913 INFO L93 Difference]: Finished difference Result 470 states and 730 transitions. [2019-01-14 15:08:11,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:11,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-01-14 15:08:11,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:11,917 INFO L225 Difference]: With dead ends: 470 [2019-01-14 15:08:11,917 INFO L226 Difference]: Without dead ends: 257 [2019-01-14 15:08:11,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-01-14 15:08:11,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-01-14 15:08:11,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-14 15:08:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2019-01-14 15:08:11,922 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 97 [2019-01-14 15:08:11,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:11,923 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2019-01-14 15:08:11,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:11,923 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2019-01-14 15:08:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 15:08:11,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:11,926 INFO L402 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-01-14 15:08:11,926 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:11,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:11,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1042376858, now seen corresponding path program 1 times [2019-01-14 15:08:11,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:11,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:11,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:11,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:11,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:12,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:12,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:12,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:12,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:12,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:12,281 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 4 states. [2019-01-14 15:08:13,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:13,099 INFO L93 Difference]: Finished difference Result 497 states and 765 transitions. [2019-01-14 15:08:13,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:13,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-01-14 15:08:13,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:13,102 INFO L225 Difference]: With dead ends: 497 [2019-01-14 15:08:13,102 INFO L226 Difference]: Without dead ends: 284 [2019-01-14 15:08:13,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:13,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-14 15:08:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2019-01-14 15:08:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-14 15:08:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2019-01-14 15:08:13,109 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 98 [2019-01-14 15:08:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:13,109 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2019-01-14 15:08:13,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2019-01-14 15:08:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 15:08:13,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:13,112 INFO L402 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-01-14 15:08:13,112 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:13,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:13,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1887815254, now seen corresponding path program 1 times [2019-01-14 15:08:13,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:13,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:13,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:13,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:13,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:13,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:13,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:13,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:13,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:13,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:13,232 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand 4 states. [2019-01-14 15:08:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:13,643 INFO L93 Difference]: Finished difference Result 496 states and 762 transitions. [2019-01-14 15:08:13,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:13,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-01-14 15:08:13,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:13,647 INFO L225 Difference]: With dead ends: 496 [2019-01-14 15:08:13,647 INFO L226 Difference]: Without dead ends: 283 [2019-01-14 15:08:13,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:13,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-01-14 15:08:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2019-01-14 15:08:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-14 15:08:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 357 transitions. [2019-01-14 15:08:13,656 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 357 transitions. Word has length 98 [2019-01-14 15:08:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:13,656 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 357 transitions. [2019-01-14 15:08:13,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 357 transitions. [2019-01-14 15:08:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 15:08:13,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:13,659 INFO L402 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-01-14 15:08:13,659 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:13,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:13,659 INFO L82 PathProgramCache]: Analyzing trace with hash 218540392, now seen corresponding path program 1 times [2019-01-14 15:08:13,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:13,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:13,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:13,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:13,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:13,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:13,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:13,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:13,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:13,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:13,948 INFO L87 Difference]: Start difference. First operand 232 states and 357 transitions. Second operand 4 states. [2019-01-14 15:08:14,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:14,541 INFO L93 Difference]: Finished difference Result 468 states and 722 transitions. [2019-01-14 15:08:14,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:14,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-01-14 15:08:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:14,544 INFO L225 Difference]: With dead ends: 468 [2019-01-14 15:08:14,544 INFO L226 Difference]: Without dead ends: 255 [2019-01-14 15:08:14,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-01-14 15:08:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 232. [2019-01-14 15:08:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-14 15:08:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 356 transitions. [2019-01-14 15:08:14,549 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 356 transitions. Word has length 98 [2019-01-14 15:08:14,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:14,549 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 356 transitions. [2019-01-14 15:08:14,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:14,549 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 356 transitions. [2019-01-14 15:08:14,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 15:08:14,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:14,550 INFO L402 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-01-14 15:08:14,550 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:14,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:14,551 INFO L82 PathProgramCache]: Analyzing trace with hash -626898004, now seen corresponding path program 1 times [2019-01-14 15:08:14,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:14,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:14,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:14,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:14,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:14,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:14,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:14,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:14,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:14,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:14,861 INFO L87 Difference]: Start difference. First operand 232 states and 356 transitions. Second operand 4 states. [2019-01-14 15:08:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:15,408 INFO L93 Difference]: Finished difference Result 467 states and 719 transitions. [2019-01-14 15:08:15,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:15,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-01-14 15:08:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:15,411 INFO L225 Difference]: With dead ends: 467 [2019-01-14 15:08:15,411 INFO L226 Difference]: Without dead ends: 254 [2019-01-14 15:08:15,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:15,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-14 15:08:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2019-01-14 15:08:15,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-14 15:08:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 355 transitions. [2019-01-14 15:08:15,418 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 355 transitions. Word has length 98 [2019-01-14 15:08:15,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:15,419 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 355 transitions. [2019-01-14 15:08:15,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 355 transitions. [2019-01-14 15:08:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 15:08:15,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:15,421 INFO L402 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, 1] [2019-01-14 15:08:15,421 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:15,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:15,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1558161604, now seen corresponding path program 1 times [2019-01-14 15:08:15,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:15,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:15,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:15,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:15,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:15,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:15,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:15,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:15,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:15,681 INFO L87 Difference]: Start difference. First operand 232 states and 355 transitions. Second operand 4 states. [2019-01-14 15:08:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:16,063 INFO L93 Difference]: Finished difference Result 495 states and 755 transitions. [2019-01-14 15:08:16,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:16,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-01-14 15:08:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:16,067 INFO L225 Difference]: With dead ends: 495 [2019-01-14 15:08:16,067 INFO L226 Difference]: Without dead ends: 282 [2019-01-14 15:08:16,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-01-14 15:08:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-01-14 15:08:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-14 15:08:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 354 transitions. [2019-01-14 15:08:16,073 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 354 transitions. Word has length 99 [2019-01-14 15:08:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:16,073 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 354 transitions. [2019-01-14 15:08:16,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 354 transitions. [2019-01-14 15:08:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 15:08:16,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:16,077 INFO L402 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-01-14 15:08:16,077 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:16,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:16,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1766691760, now seen corresponding path program 1 times [2019-01-14 15:08:16,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:16,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:16,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:16,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:16,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-14 15:08:16,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:16,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:08:16,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:08:16,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:08:16,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:16,551 INFO L87 Difference]: Start difference. First operand 232 states and 354 transitions. Second operand 5 states. [2019-01-14 15:08:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:18,171 INFO L93 Difference]: Finished difference Result 466 states and 716 transitions. [2019-01-14 15:08:18,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:08:18,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-01-14 15:08:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:18,175 INFO L225 Difference]: With dead ends: 466 [2019-01-14 15:08:18,175 INFO L226 Difference]: Without dead ends: 253 [2019-01-14 15:08:18,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:08:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-14 15:08:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-01-14 15:08:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-14 15:08:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2019-01-14 15:08:18,184 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 99 [2019-01-14 15:08:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:18,185 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2019-01-14 15:08:18,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:08:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2019-01-14 15:08:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 15:08:18,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:18,187 INFO L402 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, 1] [2019-01-14 15:08:18,187 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:18,188 INFO L82 PathProgramCache]: Analyzing trace with hash -907239660, now seen corresponding path program 1 times [2019-01-14 15:08:18,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:18,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:18,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:18,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:18,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:18,299 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:18,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:18,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:18,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:18,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:18,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:18,300 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand 4 states. [2019-01-14 15:08:18,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:18,767 INFO L93 Difference]: Finished difference Result 535 states and 804 transitions. [2019-01-14 15:08:18,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:18,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-14 15:08:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:18,770 INFO L225 Difference]: With dead ends: 535 [2019-01-14 15:08:18,770 INFO L226 Difference]: Without dead ends: 302 [2019-01-14 15:08:18,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-14 15:08:18,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-01-14 15:08:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-14 15:08:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2019-01-14 15:08:18,778 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 100 [2019-01-14 15:08:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:18,778 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2019-01-14 15:08:18,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:18,779 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2019-01-14 15:08:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 15:08:18,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:18,782 INFO L402 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, 1] [2019-01-14 15:08:18,783 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:18,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:18,783 INFO L82 PathProgramCache]: Analyzing trace with hash -346539882, now seen corresponding path program 1 times [2019-01-14 15:08:18,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:18,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:18,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:18,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:18,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:18,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:18,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:18,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:18,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:18,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:18,939 INFO L87 Difference]: Start difference. First operand 252 states and 379 transitions. Second operand 4 states. [2019-01-14 15:08:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:19,240 INFO L93 Difference]: Finished difference Result 506 states and 763 transitions. [2019-01-14 15:08:19,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:19,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-14 15:08:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:19,242 INFO L225 Difference]: With dead ends: 506 [2019-01-14 15:08:19,242 INFO L226 Difference]: Without dead ends: 273 [2019-01-14 15:08:19,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-14 15:08:19,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-01-14 15:08:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-14 15:08:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2019-01-14 15:08:19,250 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 100 [2019-01-14 15:08:19,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:19,250 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2019-01-14 15:08:19,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:19,250 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2019-01-14 15:08:19,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-14 15:08:19,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:19,251 INFO L402 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, 1] [2019-01-14 15:08:19,252 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:19,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:19,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1206682467, now seen corresponding path program 1 times [2019-01-14 15:08:19,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:19,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:19,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:19,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:19,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:19,615 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-01-14 15:08:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:19,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:19,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:19,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:19,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:19,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:19,635 INFO L87 Difference]: Start difference. First operand 252 states and 378 transitions. Second operand 4 states. [2019-01-14 15:08:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:20,147 INFO L93 Difference]: Finished difference Result 535 states and 800 transitions. [2019-01-14 15:08:20,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:20,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-01-14 15:08:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:20,151 INFO L225 Difference]: With dead ends: 535 [2019-01-14 15:08:20,151 INFO L226 Difference]: Without dead ends: 302 [2019-01-14 15:08:20,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:20,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-14 15:08:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-01-14 15:08:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-14 15:08:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2019-01-14 15:08:20,159 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 101 [2019-01-14 15:08:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:20,159 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2019-01-14 15:08:20,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:20,159 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2019-01-14 15:08:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-14 15:08:20,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:20,163 INFO L402 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, 1] [2019-01-14 15:08:20,163 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:20,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:20,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1408506401, now seen corresponding path program 1 times [2019-01-14 15:08:20,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:20,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:20,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:20,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:20,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:20,590 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-01-14 15:08:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:20,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:20,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:20,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:20,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:20,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:20,654 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand 4 states. [2019-01-14 15:08:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:20,964 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2019-01-14 15:08:20,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:20,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-01-14 15:08:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:20,968 INFO L225 Difference]: With dead ends: 506 [2019-01-14 15:08:20,968 INFO L226 Difference]: Without dead ends: 273 [2019-01-14 15:08:20,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-14 15:08:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-01-14 15:08:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-14 15:08:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2019-01-14 15:08:20,978 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 101 [2019-01-14 15:08:20,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:20,978 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2019-01-14 15:08:20,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2019-01-14 15:08:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-14 15:08:20,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:20,982 INFO L402 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, 1] [2019-01-14 15:08:20,982 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:20,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:20,982 INFO L82 PathProgramCache]: Analyzing trace with hash -610222663, now seen corresponding path program 1 times [2019-01-14 15:08:20,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:20,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:20,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:20,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:20,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:21,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:21,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:21,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:21,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:21,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:21,233 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand 4 states. [2019-01-14 15:08:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:21,970 INFO L93 Difference]: Finished difference Result 535 states and 796 transitions. [2019-01-14 15:08:21,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:21,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-01-14 15:08:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:21,973 INFO L225 Difference]: With dead ends: 535 [2019-01-14 15:08:21,973 INFO L226 Difference]: Without dead ends: 302 [2019-01-14 15:08:21,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-14 15:08:21,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-01-14 15:08:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-14 15:08:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2019-01-14 15:08:21,986 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 102 [2019-01-14 15:08:21,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:21,986 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2019-01-14 15:08:21,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2019-01-14 15:08:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-14 15:08:21,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:21,989 INFO L402 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, 1] [2019-01-14 15:08:21,990 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:21,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:21,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1351351995, now seen corresponding path program 1 times [2019-01-14 15:08:21,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:21,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:21,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:21,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:21,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:22,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:22,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:22,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:22,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:22,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:22,331 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand 4 states. [2019-01-14 15:08:22,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:22,710 INFO L93 Difference]: Finished difference Result 506 states and 755 transitions. [2019-01-14 15:08:22,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:22,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-01-14 15:08:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:22,713 INFO L225 Difference]: With dead ends: 506 [2019-01-14 15:08:22,713 INFO L226 Difference]: Without dead ends: 273 [2019-01-14 15:08:22,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-14 15:08:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-01-14 15:08:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-14 15:08:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2019-01-14 15:08:22,721 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 102 [2019-01-14 15:08:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:22,723 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2019-01-14 15:08:22,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2019-01-14 15:08:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-14 15:08:22,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:22,724 INFO L402 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, 1] [2019-01-14 15:08:22,724 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:22,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:22,727 INFO L82 PathProgramCache]: Analyzing trace with hash 271278824, now seen corresponding path program 1 times [2019-01-14 15:08:22,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:22,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:22,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:22,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:22,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:23,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:23,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:23,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:23,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:23,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:23,054 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand 4 states. [2019-01-14 15:08:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:23,422 INFO L93 Difference]: Finished difference Result 525 states and 780 transitions. [2019-01-14 15:08:23,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:23,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-01-14 15:08:23,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:23,425 INFO L225 Difference]: With dead ends: 525 [2019-01-14 15:08:23,425 INFO L226 Difference]: Without dead ends: 292 [2019-01-14 15:08:23,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-01-14 15:08:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2019-01-14 15:08:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-14 15:08:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2019-01-14 15:08:23,434 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 103 [2019-01-14 15:08:23,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:23,435 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2019-01-14 15:08:23,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2019-01-14 15:08:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-14 15:08:23,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:23,438 INFO L402 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, 1] [2019-01-14 15:08:23,439 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:23,439 INFO L82 PathProgramCache]: Analyzing trace with hash 950551078, now seen corresponding path program 1 times [2019-01-14 15:08:23,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:23,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:23,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:23,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:23,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:23,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:23,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:23,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:23,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:23,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:23,575 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand 4 states. [2019-01-14 15:08:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:23,864 INFO L93 Difference]: Finished difference Result 496 states and 739 transitions. [2019-01-14 15:08:23,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:23,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-01-14 15:08:23,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:23,867 INFO L225 Difference]: With dead ends: 496 [2019-01-14 15:08:23,867 INFO L226 Difference]: Without dead ends: 263 [2019-01-14 15:08:23,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:23,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-01-14 15:08:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 252. [2019-01-14 15:08:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-14 15:08:23,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2019-01-14 15:08:23,876 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 103 [2019-01-14 15:08:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:23,876 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2019-01-14 15:08:23,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2019-01-14 15:08:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-14 15:08:23,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:23,880 INFO L402 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-01-14 15:08:23,880 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:23,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:23,880 INFO L82 PathProgramCache]: Analyzing trace with hash -504345715, now seen corresponding path program 1 times [2019-01-14 15:08:23,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:23,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:23,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:23,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:23,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:24,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:24,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:24,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:24,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:24,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:24,143 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand 4 states. [2019-01-14 15:08:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:24,574 INFO L93 Difference]: Finished difference Result 525 states and 776 transitions. [2019-01-14 15:08:24,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:24,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-01-14 15:08:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:24,578 INFO L225 Difference]: With dead ends: 525 [2019-01-14 15:08:24,578 INFO L226 Difference]: Without dead ends: 292 [2019-01-14 15:08:24,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:24,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-01-14 15:08:24,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2019-01-14 15:08:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-14 15:08:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2019-01-14 15:08:24,588 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 106 [2019-01-14 15:08:24,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:24,589 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2019-01-14 15:08:24,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:24,589 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2019-01-14 15:08:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-14 15:08:24,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:24,590 INFO L402 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-01-14 15:08:24,590 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:24,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:24,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2104441743, now seen corresponding path program 1 times [2019-01-14 15:08:24,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:24,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:24,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:24,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:24,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-14 15:08:24,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:24,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:08:24,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:08:24,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:08:24,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:08:24,692 INFO L87 Difference]: Start difference. First operand 252 states and 371 transitions. Second operand 3 states. [2019-01-14 15:08:24,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:24,973 INFO L93 Difference]: Finished difference Result 716 states and 1068 transitions. [2019-01-14 15:08:24,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:08:24,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-01-14 15:08:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:24,978 INFO L225 Difference]: With dead ends: 716 [2019-01-14 15:08:24,978 INFO L226 Difference]: Without dead ends: 483 [2019-01-14 15:08:24,978 INFO L631 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-01-14 15:08:24,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-01-14 15:08:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-01-14 15:08:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-01-14 15:08:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 716 transitions. [2019-01-14 15:08:24,997 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 716 transitions. Word has length 106 [2019-01-14 15:08:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:24,997 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 716 transitions. [2019-01-14 15:08:24,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:08:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 716 transitions. [2019-01-14 15:08:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-14 15:08:25,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:25,000 INFO L402 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-01-14 15:08:25,002 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:25,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:25,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1080065455, now seen corresponding path program 1 times [2019-01-14 15:08:25,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:25,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:25,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:25,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:25,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 15:08:25,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:25,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:08:25,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:08:25,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:08:25,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:08:25,102 INFO L87 Difference]: Start difference. First operand 483 states and 716 transitions. Second operand 3 states. [2019-01-14 15:08:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:25,163 INFO L93 Difference]: Finished difference Result 947 states and 1410 transitions. [2019-01-14 15:08:25,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:08:25,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-01-14 15:08:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:25,168 INFO L225 Difference]: With dead ends: 947 [2019-01-14 15:08:25,168 INFO L226 Difference]: Without dead ends: 483 [2019-01-14 15:08:25,169 INFO L631 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-01-14 15:08:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-01-14 15:08:25,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-01-14 15:08:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-01-14 15:08:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 711 transitions. [2019-01-14 15:08:25,184 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 711 transitions. Word has length 125 [2019-01-14 15:08:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:25,187 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 711 transitions. [2019-01-14 15:08:25,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:08:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 711 transitions. [2019-01-14 15:08:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-14 15:08:25,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:25,190 INFO L402 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, 1] [2019-01-14 15:08:25,190 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:25,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:25,190 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2019-01-14 15:08:25,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:25,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:25,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:08:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:08:25,491 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:08:25,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:08:25 BoogieIcfgContainer [2019-01-14 15:08:25,634 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:08:25,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:08:25,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:08:25,634 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:08:25,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:55" (3/4) ... [2019-01-14 15:08:25,642 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 15:08:25,642 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:08:25,643 INFO L168 Benchmark]: Toolchain (without parser) took 33975.94 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 367.0 MB). Free memory was 941.9 MB in the beginning and 889.2 MB in the end (delta: 52.7 MB). Peak memory consumption was 419.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:25,644 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:08:25,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 903.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:25,646 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.47 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-01-14 15:08:25,648 INFO L168 Benchmark]: Boogie Preprocessor took 130.87 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-01-14 15:08:25,649 INFO L168 Benchmark]: RCFGBuilder took 2417.93 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: 90.2 MB). Peak memory consumption was 90.2 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:25,650 INFO L168 Benchmark]: TraceAbstraction took 30400.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.6 MB). Free memory was 1.0 GB in the beginning and 889.2 MB in the end (delta: 147.5 MB). Peak memory consumption was 354.1 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:25,651 INFO L168 Benchmark]: Witness Printer took 8.02 ms. Allocated memory is still 1.4 GB. Free memory is still 889.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:08:25,657 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 903.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.47 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 130.87 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 2417.93 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: 90.2 MB). Peak memory consumption was 90.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30400.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.6 MB). Free memory was 1.0 GB in the beginning and 889.2 MB in the end (delta: 147.5 MB). Peak memory consumption was 354.1 MB. Max. memory is 11.5 GB. * Witness Printer took 8.02 ms. Allocated memory is still 1.4 GB. Free memory is still 889.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1706]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1120. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-5: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 = __VERIFIER_nondet_pointer() ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp = __VERIFIER_nondet_long() ; [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 ; [L1095] int tmp___4 ; [L1096] int tmp___5 ; [L1097] int tmp___6 ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 ; [L1101] int tmp___10 ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] Time = tmp [L1110] cb = (void (*)())((void *)0) [L1111] ret = -1 [L1112] skip = 0 [L1113] got_new_session = 0 [L1114] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-5:0}] [L1114] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1115] EXPR s->info_callback [L1115] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-5:0}] [L1129] EXPR s->cert VAL [init=1, SSLv3_server_data={-5:0}] [L1129] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-5:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1162] COND TRUE s->state == 8464 [L1318] s->shutdown = 0 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 0 [L1321] blastFlag = 1 VAL [init=1, SSLv3_server_data={-5:0}] [L1325] COND FALSE !(ret <= 0) [L1330] got_new_session = 1 [L1331] s->state = 8496 [L1332] s->init_num = 0 VAL [init=1, SSLv3_server_data={-5:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-5:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-5:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-5:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1171] COND TRUE s->state == 8496 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [init=1, SSLv3_server_data={-5:0}] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [init=1, SSLv3_server_data={-5:0}] [L1347] COND TRUE s->hit [L1348] s->state = 8656 VAL [init=1, SSLv3_server_data={-5:0}] [L1352] s->init_num = 0 VAL [init=1, SSLv3_server_data={-5:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-5:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-5:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-5:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1228] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] tmp___9 = __VERIFIER_nondet_int() [L1554] COND FALSE !(! tmp___9) [L1560] ret = __VERIFIER_nondet_int() [L1561] COND TRUE blastFlag == 2 [L1562] blastFlag = 5 VAL [init=1, SSLv3_server_data={-5:0}] [L1566] COND FALSE !(ret <= 0) [L1571] s->state = 8672 [L1572] s->init_num = 0 [L1573] tmp___10 = __VERIFIER_nondet_int() [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-5:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-5:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-5:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-5:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1228] COND FALSE !(s->state == 8656) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1231] COND FALSE !(s->state == 8657) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={-5:0}] [L1234] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={-5:0}] [L1587] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={-5:0}] [L1706] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. UNSAFE Result, 30.3s OverallTime, 40 OverallIterations, 4 TraceHistogramMax, 19.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7567 SDtfs, 2263 SDslu, 10403 SDs, 0 SdLazy, 6834 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 78 SyntacticMatches, 73 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 933 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 3434 NumberOfCodeBlocks, 3434 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3269 ConstructedInterpolants, 0 QuantifiedInterpolants, 773930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 1667/1667 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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-0ed9222-m [2019-01-14 15:08:27,834 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:08:27,835 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:08:27,847 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:08:27,847 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:08:27,848 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:08:27,849 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:08:27,851 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:08:27,852 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:08:27,853 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:08:27,854 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:08:27,854 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:08:27,855 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:08:27,856 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:08:27,857 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:08:27,858 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:08:27,859 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:08:27,861 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:08:27,863 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:08:27,864 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:08:27,865 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:08:27,866 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:08:27,869 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:08:27,869 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:08:27,869 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:08:27,870 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:08:27,874 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:08:27,875 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:08:27,876 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:08:27,877 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:08:27,877 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:08:27,878 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:08:27,878 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:08:27,878 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:08:27,879 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:08:27,886 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:08:27,887 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-14 15:08:27,919 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:08:27,920 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:08:27,924 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:08:27,924 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:08:27,924 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:08:27,924 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:08:27,925 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:08:27,925 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:08:27,925 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:08:27,925 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:08:27,925 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:08:27,925 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:08:27,926 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-14 15:08:27,926 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-14 15:08:27,926 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:08:27,926 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:08:27,926 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:08:27,927 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:08:27,928 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:08:27,928 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:08:27,929 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:08:27,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:08:27,929 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:08:27,929 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:08:27,929 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:08:27,929 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-14 15:08:27,930 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:08:27,930 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-14 15:08:27,930 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-14 15:08:27,931 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 9c69768cb083538b139479bdbb35676eb3378c1b [2019-01-14 15:08:27,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:08:28,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:08:28,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:08:28,015 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:08:28,016 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:08:28,017 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh/s3_srvr.blast.01_false-unreach-call.i.cil.c [2019-01-14 15:08:28,085 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f3e719c/7237288dee964903a65c77637c19e0c3/FLAGe78bc28c9 [2019-01-14 15:08:28,591 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:08:28,593 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh/s3_srvr.blast.01_false-unreach-call.i.cil.c [2019-01-14 15:08:28,622 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f3e719c/7237288dee964903a65c77637c19e0c3/FLAGe78bc28c9 [2019-01-14 15:08:28,841 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f3e719c/7237288dee964903a65c77637c19e0c3 [2019-01-14 15:08:28,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:08:28,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:08:28,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:08:28,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:08:28,850 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:08:28,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:08:28" (1/1) ... [2019-01-14 15:08:28,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8b5888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:28, skipping insertion in model container [2019-01-14 15:08:28,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:08:28" (1/1) ... [2019-01-14 15:08:28,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:08:28,923 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:08:29,411 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:08:29,517 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:08:29,669 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:08:29,699 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:08:29,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:29 WrapperNode [2019-01-14 15:08:29,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:08:29,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:08:29,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:08:29,701 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:08:29,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:29" (1/1) ... [2019-01-14 15:08:29,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:29" (1/1) ... [2019-01-14 15:08:29,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:08:29,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:08:29,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:08:29,819 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:08:29,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:29" (1/1) ... [2019-01-14 15:08:29,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:29" (1/1) ... [2019-01-14 15:08:29,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:29" (1/1) ... [2019-01-14 15:08:29,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:29" (1/1) ... [2019-01-14 15:08:29,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:29" (1/1) ... [2019-01-14 15:08:29,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:29" (1/1) ... [2019-01-14 15:08:29,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:29" (1/1) ... [2019-01-14 15:08:29,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:08:29,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:08:29,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:08:29,916 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:08:29,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:29" (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-01-14 15:08:29,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 15:08:29,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-01-14 15:08:29,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:08:29,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:08:29,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-14 15:08:29,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:08:29,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:08:29,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:08:29,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:08:29,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-14 15:08:30,402 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 15:08:34,700 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-01-14 15:08:34,700 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-01-14 15:08:34,702 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:08:34,702 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 15:08:34,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:08:34 BoogieIcfgContainer [2019-01-14 15:08:34,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:08:34,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:08:34,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:08:34,707 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:08:34,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:08:28" (1/3) ... [2019-01-14 15:08:34,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c7a741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:08:34, skipping insertion in model container [2019-01-14 15:08:34,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:29" (2/3) ... [2019-01-14 15:08:34,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c7a741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:08:34, skipping insertion in model container [2019-01-14 15:08:34,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:08:34" (3/3) ... [2019-01-14 15:08:34,711 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01_false-unreach-call.i.cil.c [2019-01-14 15:08:34,719 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:08:34,727 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:08:34,740 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:08:34,768 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:08:34,769 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:08:34,769 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:08:34,769 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:08:34,769 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:08:34,769 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:08:34,769 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:08:34,770 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:08:34,771 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:08:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-01-14 15:08:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 15:08:34,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:34,801 INFO L402 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-01-14 15:08:34,804 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:34,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:34,809 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2019-01-14 15:08:34,814 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:34,814 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 15:08:34,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:35,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:35,161 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2019-01-14 15:08:35,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:35,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:08:35,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:08:35,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:08:35,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:08:35,199 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-01-14 15:08:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:35,585 INFO L93 Difference]: Finished difference Result 416 states and 701 transitions. [2019-01-14 15:08:35,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:08:35,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-01-14 15:08:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:35,604 INFO L225 Difference]: With dead ends: 416 [2019-01-14 15:08:35,604 INFO L226 Difference]: Without dead ends: 253 [2019-01-14 15:08:35,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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-01-14 15:08:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-14 15:08:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-01-14 15:08:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-14 15:08:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 381 transitions. [2019-01-14 15:08:35,681 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 381 transitions. Word has length 45 [2019-01-14 15:08:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:35,682 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 381 transitions. [2019-01-14 15:08:35,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:08:35,683 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 381 transitions. [2019-01-14 15:08:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 15:08:35,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:35,688 INFO L402 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-01-14 15:08:35,688 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:35,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:35,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1383513241, now seen corresponding path program 1 times [2019-01-14 15:08:35,690 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:35,690 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 15:08:35,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:35,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:35,928 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:08:35,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:35,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:08:35,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:08:35,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:08:35,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:08:35,935 INFO L87 Difference]: Start difference. First operand 253 states and 381 transitions. Second operand 3 states. [2019-01-14 15:08:36,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:36,782 INFO L93 Difference]: Finished difference Result 496 states and 754 transitions. [2019-01-14 15:08:36,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:08:36,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-01-14 15:08:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:36,787 INFO L225 Difference]: With dead ends: 496 [2019-01-14 15:08:36,787 INFO L226 Difference]: Without dead ends: 372 [2019-01-14 15:08:36,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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-01-14 15:08:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-01-14 15:08:36,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-01-14 15:08:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-01-14 15:08:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 559 transitions. [2019-01-14 15:08:36,824 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 559 transitions. Word has length 62 [2019-01-14 15:08:36,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:36,825 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 559 transitions. [2019-01-14 15:08:36,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:08:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 559 transitions. [2019-01-14 15:08:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 15:08:36,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:36,831 INFO L402 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-01-14 15:08:36,832 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1575477095, now seen corresponding path program 1 times [2019-01-14 15:08:36,834 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:36,834 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 15:08:36,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:37,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:08:37,110 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:08:37,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:37,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:08:37,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:08:37,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:08:37,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:08:37,117 INFO L87 Difference]: Start difference. First operand 372 states and 559 transitions. Second operand 3 states. [2019-01-14 15:08:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:37,800 INFO L93 Difference]: Finished difference Result 735 states and 1112 transitions. [2019-01-14 15:08:37,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:08:37,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-14 15:08:37,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:37,811 INFO L225 Difference]: With dead ends: 735 [2019-01-14 15:08:37,811 INFO L226 Difference]: Without dead ends: 492 [2019-01-14 15:08:37,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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-01-14 15:08:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-01-14 15:08:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2019-01-14 15:08:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-01-14 15:08:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 739 transitions. [2019-01-14 15:08:37,858 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 739 transitions. Word has length 84 [2019-01-14 15:08:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:37,859 INFO L480 AbstractCegarLoop]: Abstraction has 492 states and 739 transitions. [2019-01-14 15:08:37,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:08:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 739 transitions. [2019-01-14 15:08:37,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-14 15:08:37,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:37,874 INFO L402 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-01-14 15:08:37,874 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:37,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:37,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1080065455, now seen corresponding path program 1 times [2019-01-14 15:08:37,878 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:37,878 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:08:37,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:38,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 15:08:38,360 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:08:38,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:38,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:08:38,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:08:38,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:08:38,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:08:38,370 INFO L87 Difference]: Start difference. First operand 492 states and 739 transitions. Second operand 3 states. [2019-01-14 15:08:40,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:40,481 INFO L93 Difference]: Finished difference Result 852 states and 1282 transitions. [2019-01-14 15:08:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:08:40,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-01-14 15:08:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:40,488 INFO L225 Difference]: With dead ends: 852 [2019-01-14 15:08:40,489 INFO L226 Difference]: Without dead ends: 489 [2019-01-14 15:08:40,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 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-01-14 15:08:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-01-14 15:08:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2019-01-14 15:08:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-01-14 15:08:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 729 transitions. [2019-01-14 15:08:40,549 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 729 transitions. Word has length 125 [2019-01-14 15:08:40,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:40,550 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 729 transitions. [2019-01-14 15:08:40,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:08:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 729 transitions. [2019-01-14 15:08:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-14 15:08:40,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:40,554 INFO L402 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, 1] [2019-01-14 15:08:40,554 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:40,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:40,554 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2019-01-14 15:08:40,559 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:40,559 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:08:40,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:08:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:08:44,069 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:08:44,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:08:44 BoogieIcfgContainer [2019-01-14 15:08:44,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:08:44,233 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:08:44,233 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:08:44,234 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:08:44,234 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:08:34" (3/4) ... [2019-01-14 15:08:44,243 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 15:08:44,414 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:08:44,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:08:44,415 INFO L168 Benchmark]: Toolchain (without parser) took 15570.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 54.3 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:44,417 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:08:44,417 INFO L168 Benchmark]: CACSL2BoogieTranslator took 853.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:44,418 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.18 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:44,421 INFO L168 Benchmark]: Boogie Preprocessor took 96.24 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:44,421 INFO L168 Benchmark]: RCFGBuilder took 4787.69 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: 89.9 MB). Peak memory consumption was 89.9 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:44,421 INFO L168 Benchmark]: TraceAbstraction took 9528.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -102.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:08:44,422 INFO L168 Benchmark]: Witness Printer took 181.46 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: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:44,425 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 853.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.18 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.24 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4787.69 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: 89.9 MB). Peak memory consumption was 89.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9528.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -102.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 181.46 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: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1706]: 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={-220147386: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 = __VERIFIER_nondet_pointer() ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp = __VERIFIER_nondet_long() ; [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 ; [L1095] int tmp___4 ; [L1096] int tmp___5 ; [L1097] int tmp___6 ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 ; [L1101] int tmp___10 ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] Time = tmp [L1110] cb = (void (*)())((void *)0) [L1111] ret = -1 [L1112] skip = 0 [L1113] got_new_session = 0 [L1114] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-220147386:0}] [L1114] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1115] EXPR s->info_callback [L1115] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-220147386:0}] [L1129] EXPR s->cert VAL [init=1, SSLv3_server_data={-220147386:0}] [L1129] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-220147386:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1162] COND TRUE s->state == 8464 [L1318] s->shutdown = 0 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 0 [L1321] blastFlag = 1 VAL [init=1, SSLv3_server_data={-220147386:0}] [L1325] COND FALSE !(ret <= 0) [L1330] got_new_session = 1 [L1331] s->state = 8496 [L1332] s->init_num = 0 VAL [init=1, SSLv3_server_data={-220147386:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-220147386:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-220147386:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-220147386:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1171] COND TRUE s->state == 8496 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [init=1, SSLv3_server_data={-220147386:0}] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [init=1, SSLv3_server_data={-220147386:0}] [L1347] COND TRUE s->hit [L1348] s->state = 8656 VAL [init=1, SSLv3_server_data={-220147386:0}] [L1352] s->init_num = 0 VAL [init=1, SSLv3_server_data={-220147386:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-220147386:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-220147386:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-220147386:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1228] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] tmp___9 = __VERIFIER_nondet_int() [L1554] COND FALSE !(! tmp___9) [L1560] ret = __VERIFIER_nondet_int() [L1561] COND TRUE blastFlag == 2 [L1562] blastFlag = 5 VAL [init=1, SSLv3_server_data={-220147386:0}] [L1566] COND FALSE !(ret <= 0) [L1571] s->state = 8672 [L1572] s->init_num = 0 [L1573] tmp___10 = __VERIFIER_nondet_int() [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-220147386:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-220147386:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-220147386:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-220147386:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1228] COND FALSE !(s->state == 8656) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1231] COND FALSE !(s->state == 8657) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={-220147386:0}] [L1234] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={-220147386:0}] [L1587] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={-220147386:0}] [L1706] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-220147386:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. UNSAFE Result, 9.4s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1345 SDtfs, 599 SDslu, 777 SDs, 0 SdLazy, 68 SolverSat, 20 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=492occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 54174 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1025 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 153/153 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...