./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/bin/uautomizer --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 f0194e72737fa00e9def2494335d4249cbea0bcd ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-11-15 23:26:20,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:26:20,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:26:20,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:26:20,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:26:20,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:26:20,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:26:20,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:26:20,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:26:20,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:26:20,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:26:20,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:26:20,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:26:20,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:26:20,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:26:20,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:26:20,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:26:20,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:26:20,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:26:20,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:26:20,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:26:20,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:26:20,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:26:20,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:26:20,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:26:20,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:26:20,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:26:20,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:26:20,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:26:20,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:26:20,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:26:20,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:26:20,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:26:20,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:26:20,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:26:20,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:26:20,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:26:20,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:26:20,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:26:20,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:26:20,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:26:20,805 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:26:20,829 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:26:20,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:26:20,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:26:20,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:26:20,840 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:26:20,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:26:20,841 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:26:20,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:26:20,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:26:20,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:26:20,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:26:20,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:26:20,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:26:20,843 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:26:20,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:26:20,844 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:26:20,844 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:26:20,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:26:20,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:26:20,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:26:20,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:26:20,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:26:20,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:26:20,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:26:20,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:26:20,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:26:20,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:26:20,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:26:20,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/bin/uautomizer 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 -> f0194e72737fa00e9def2494335d4249cbea0bcd [2019-11-15 23:26:20,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:26:20,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:26:20,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:26:20,885 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:26:20,886 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:26:20,886 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.c [2019-11-15 23:26:20,940 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/bin/uautomizer/data/b3ed54b71/49e971d3f29444dbbb14275709039ed0/FLAGe9cd12cbe [2019-11-15 23:26:21,390 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:26:21,391 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.c [2019-11-15 23:26:21,409 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/bin/uautomizer/data/b3ed54b71/49e971d3f29444dbbb14275709039ed0/FLAGe9cd12cbe [2019-11-15 23:26:21,753 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/bin/uautomizer/data/b3ed54b71/49e971d3f29444dbbb14275709039ed0 [2019-11-15 23:26:21,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:26:21,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:26:21,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:21,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:26:21,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:26:21,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:21" (1/1) ... [2019-11-15 23:26:21,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55009174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:21, skipping insertion in model container [2019-11-15 23:26:21,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:21" (1/1) ... [2019-11-15 23:26:21,780 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:26:21,830 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:26:22,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:26:22,158 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:26:22,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:26:22,244 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:26:22,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:22 WrapperNode [2019-11-15 23:26:22,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:22,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:26:22,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:26:22,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:26:22,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:22" (1/1) ... [2019-11-15 23:26:22,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:22" (1/1) ... [2019-11-15 23:26:22,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:26:22,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:26:22,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:26:22,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:26:22,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:22" (1/1) ... [2019-11-15 23:26:22,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:22" (1/1) ... [2019-11-15 23:26:22,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:22" (1/1) ... [2019-11-15 23:26:22,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:22" (1/1) ... [2019-11-15 23:26:22,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:22" (1/1) ... [2019-11-15 23:26:22,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:22" (1/1) ... [2019-11-15 23:26:22,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:22" (1/1) ... [2019-11-15 23:26:22,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:26:22,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:26:22,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:26:22,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:26:22,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:26:22,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:26:22,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:26:22,670 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:26:23,303 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-15 23:26:23,303 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-15 23:26:23,304 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:26:23,304 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:26:23,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:23 BoogieIcfgContainer [2019-11-15 23:26:23,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:26:23,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:26:23,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:26:23,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:26:23,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:26:21" (1/3) ... [2019-11-15 23:26:23,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de17779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:26:23, skipping insertion in model container [2019-11-15 23:26:23,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:22" (2/3) ... [2019-11-15 23:26:23,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de17779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:26:23, skipping insertion in model container [2019-11-15 23:26:23,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:23" (3/3) ... [2019-11-15 23:26:23,313 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.c [2019-11-15 23:26:23,321 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:26:23,326 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:26:23,334 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:26:23,355 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:26:23,355 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:26:23,355 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:26:23,355 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:26:23,356 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:26:23,356 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:26:23,356 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:26:23,356 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:26:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2019-11-15 23:26:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:26:23,380 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:23,380 INFO L380 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] [2019-11-15 23:26:23,382 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:23,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:23,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1734880928, now seen corresponding path program 1 times [2019-11-15 23:26:23,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:23,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046300108] [2019-11-15 23:26:23,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:23,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:23,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:23,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046300108] [2019-11-15 23:26:23,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:23,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:26:23,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586791621] [2019-11-15 23:26:23,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:23,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:23,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:23,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:23,574 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2019-11-15 23:26:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:23,848 INFO L93 Difference]: Finished difference Result 323 states and 555 transitions. [2019-11-15 23:26:23,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:23,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 23:26:23,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:23,867 INFO L225 Difference]: With dead ends: 323 [2019-11-15 23:26:23,868 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 23:26:23,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 23:26:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2019-11-15 23:26:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-15 23:26:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2019-11-15 23:26:23,955 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 22 [2019-11-15 23:26:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:23,956 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2019-11-15 23:26:23,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2019-11-15 23:26:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:26:23,961 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:23,961 INFO L380 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] [2019-11-15 23:26:23,961 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:23,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:23,962 INFO L82 PathProgramCache]: Analyzing trace with hash -923936279, now seen corresponding path program 1 times [2019-11-15 23:26:23,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:23,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409862434] [2019-11-15 23:26:23,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:23,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:23,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:24,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409862434] [2019-11-15 23:26:24,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:24,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:26:24,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14401422] [2019-11-15 23:26:24,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:24,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:24,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:24,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:24,053 INFO L87 Difference]: Start difference. First operand 156 states and 248 transitions. Second operand 3 states. [2019-11-15 23:26:24,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:24,235 INFO L93 Difference]: Finished difference Result 330 states and 522 transitions. [2019-11-15 23:26:24,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:24,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:26:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:24,238 INFO L225 Difference]: With dead ends: 330 [2019-11-15 23:26:24,238 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 23:26:24,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:24,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 23:26:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-11-15 23:26:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-15 23:26:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 281 transitions. [2019-11-15 23:26:24,266 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 281 transitions. Word has length 23 [2019-11-15 23:26:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:24,267 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 281 transitions. [2019-11-15 23:26:24,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 281 transitions. [2019-11-15 23:26:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:26:24,269 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:24,269 INFO L380 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] [2019-11-15 23:26:24,269 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:24,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:24,270 INFO L82 PathProgramCache]: Analyzing trace with hash -936892908, now seen corresponding path program 1 times [2019-11-15 23:26:24,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:24,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799499473] [2019-11-15 23:26:24,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:24,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:24,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:24,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799499473] [2019-11-15 23:26:24,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:24,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:26:24,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48946408] [2019-11-15 23:26:24,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:24,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:24,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:24,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:24,326 INFO L87 Difference]: Start difference. First operand 179 states and 281 transitions. Second operand 3 states. [2019-11-15 23:26:24,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:24,510 INFO L93 Difference]: Finished difference Result 361 states and 566 transitions. [2019-11-15 23:26:24,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:24,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:26:24,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:24,514 INFO L225 Difference]: With dead ends: 361 [2019-11-15 23:26:24,514 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 23:26:24,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:24,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 23:26:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2019-11-15 23:26:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-15 23:26:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 292 transitions. [2019-11-15 23:26:24,534 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 292 transitions. Word has length 23 [2019-11-15 23:26:24,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:24,534 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 292 transitions. [2019-11-15 23:26:24,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 292 transitions. [2019-11-15 23:26:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:26:24,536 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:24,536 INFO L380 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] [2019-11-15 23:26:24,536 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:24,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1640243884, now seen corresponding path program 1 times [2019-11-15 23:26:24,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:24,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834626361] [2019-11-15 23:26:24,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:24,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:24,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:24,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834626361] [2019-11-15 23:26:24,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:24,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:26:24,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776989955] [2019-11-15 23:26:24,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:24,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:24,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:24,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:24,588 INFO L87 Difference]: Start difference. First operand 185 states and 292 transitions. Second operand 3 states. [2019-11-15 23:26:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:24,769 INFO L93 Difference]: Finished difference Result 366 states and 576 transitions. [2019-11-15 23:26:24,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:24,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:26:24,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:24,771 INFO L225 Difference]: With dead ends: 366 [2019-11-15 23:26:24,771 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 23:26:24,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:24,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 23:26:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-11-15 23:26:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-15 23:26:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2019-11-15 23:26:24,792 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 23 [2019-11-15 23:26:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:24,793 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2019-11-15 23:26:24,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2019-11-15 23:26:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:26:24,794 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:24,794 INFO L380 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] [2019-11-15 23:26:24,795 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:24,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:24,795 INFO L82 PathProgramCache]: Analyzing trace with hash 940477948, now seen corresponding path program 1 times [2019-11-15 23:26:24,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:24,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932556130] [2019-11-15 23:26:24,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:24,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:24,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:24,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932556130] [2019-11-15 23:26:24,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:24,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:26:24,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089222705] [2019-11-15 23:26:24,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:24,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:24,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:24,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:24,834 INFO L87 Difference]: Start difference. First operand 186 states and 293 transitions. Second operand 3 states. [2019-11-15 23:26:24,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:24,973 INFO L93 Difference]: Finished difference Result 377 states and 588 transitions. [2019-11-15 23:26:24,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:24,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 23:26:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:24,975 INFO L225 Difference]: With dead ends: 377 [2019-11-15 23:26:24,975 INFO L226 Difference]: Without dead ends: 198 [2019-11-15 23:26:24,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-15 23:26:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-15 23:26:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-15 23:26:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 291 transitions. [2019-11-15 23:26:24,986 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 291 transitions. Word has length 24 [2019-11-15 23:26:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:24,986 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 291 transitions. [2019-11-15 23:26:24,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2019-11-15 23:26:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:26:24,988 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:24,988 INFO L380 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] [2019-11-15 23:26:24,989 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:24,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:24,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1862867376, now seen corresponding path program 1 times [2019-11-15 23:26:24,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:24,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402474804] [2019-11-15 23:26:24,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:24,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:24,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:25,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402474804] [2019-11-15 23:26:25,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:25,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:26:25,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804314866] [2019-11-15 23:26:25,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:25,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:25,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:25,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:25,034 INFO L87 Difference]: Start difference. First operand 186 states and 291 transitions. Second operand 3 states. [2019-11-15 23:26:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:25,196 INFO L93 Difference]: Finished difference Result 377 states and 584 transitions. [2019-11-15 23:26:25,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:25,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 23:26:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:25,198 INFO L225 Difference]: With dead ends: 377 [2019-11-15 23:26:25,198 INFO L226 Difference]: Without dead ends: 198 [2019-11-15 23:26:25,199 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-15 23:26:25,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-15 23:26:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-15 23:26:25,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 289 transitions. [2019-11-15 23:26:25,207 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 289 transitions. Word has length 25 [2019-11-15 23:26:25,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:25,208 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 289 transitions. [2019-11-15 23:26:25,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2019-11-15 23:26:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:26:25,209 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:25,209 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:26:25,209 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:25,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2134464983, now seen corresponding path program 1 times [2019-11-15 23:26:25,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:25,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103226730] [2019-11-15 23:26:25,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:25,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:25,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:25,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103226730] [2019-11-15 23:26:25,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:25,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:26:25,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320959349] [2019-11-15 23:26:25,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:25,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:25,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:25,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:25,236 INFO L87 Difference]: Start difference. First operand 186 states and 289 transitions. Second operand 3 states. [2019-11-15 23:26:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:25,352 INFO L93 Difference]: Finished difference Result 377 states and 580 transitions. [2019-11-15 23:26:25,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:25,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 23:26:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:25,354 INFO L225 Difference]: With dead ends: 377 [2019-11-15 23:26:25,354 INFO L226 Difference]: Without dead ends: 198 [2019-11-15 23:26:25,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-15 23:26:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-15 23:26:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-15 23:26:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 287 transitions. [2019-11-15 23:26:25,363 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 287 transitions. Word has length 26 [2019-11-15 23:26:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:25,363 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 287 transitions. [2019-11-15 23:26:25,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 287 transitions. [2019-11-15 23:26:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:26:25,364 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:25,364 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:26:25,364 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:25,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:25,365 INFO L82 PathProgramCache]: Analyzing trace with hash 744248342, now seen corresponding path program 1 times [2019-11-15 23:26:25,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:25,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330076699] [2019-11-15 23:26:25,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:25,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:25,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:25,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330076699] [2019-11-15 23:26:25,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:25,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:26:25,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792612813] [2019-11-15 23:26:25,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:25,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:25,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:25,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:25,394 INFO L87 Difference]: Start difference. First operand 186 states and 287 transitions. Second operand 3 states. [2019-11-15 23:26:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:25,423 INFO L93 Difference]: Finished difference Result 536 states and 822 transitions. [2019-11-15 23:26:25,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:25,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 23:26:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:25,432 INFO L225 Difference]: With dead ends: 536 [2019-11-15 23:26:25,432 INFO L226 Difference]: Without dead ends: 357 [2019-11-15 23:26:25,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:25,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-15 23:26:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2019-11-15 23:26:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-15 23:26:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 542 transitions. [2019-11-15 23:26:25,452 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 542 transitions. Word has length 26 [2019-11-15 23:26:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:25,452 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 542 transitions. [2019-11-15 23:26:25,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 542 transitions. [2019-11-15 23:26:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:26:25,453 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:25,454 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:26:25,454 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:25,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1232648243, now seen corresponding path program 1 times [2019-11-15 23:26:25,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:25,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986517083] [2019-11-15 23:26:25,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:25,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:25,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:25,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986517083] [2019-11-15 23:26:25,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:25,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:26:25,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436565840] [2019-11-15 23:26:25,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:26:25,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:25,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:26:25,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:26:25,506 INFO L87 Difference]: Start difference. First operand 355 states and 542 transitions. Second operand 4 states. [2019-11-15 23:26:25,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:25,780 INFO L93 Difference]: Finished difference Result 1099 states and 1679 transitions. [2019-11-15 23:26:25,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:26:25,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-15 23:26:25,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:25,785 INFO L225 Difference]: With dead ends: 1099 [2019-11-15 23:26:25,785 INFO L226 Difference]: Without dead ends: 752 [2019-11-15 23:26:25,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:26:25,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-11-15 23:26:25,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 598. [2019-11-15 23:26:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-15 23:26:25,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 927 transitions. [2019-11-15 23:26:25,811 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 927 transitions. Word has length 27 [2019-11-15 23:26:25,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:25,811 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 927 transitions. [2019-11-15 23:26:25,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:26:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 927 transitions. [2019-11-15 23:26:25,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:26:25,813 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:25,813 INFO L380 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] [2019-11-15 23:26:25,813 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:25,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:25,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1405707043, now seen corresponding path program 1 times [2019-11-15 23:26:25,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:25,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182835019] [2019-11-15 23:26:25,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:25,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:25,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:25,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182835019] [2019-11-15 23:26:25,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:25,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:26:25,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765927385] [2019-11-15 23:26:25,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:25,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:25,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:25,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:25,844 INFO L87 Difference]: Start difference. First operand 598 states and 927 transitions. Second operand 3 states. [2019-11-15 23:26:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:26,026 INFO L93 Difference]: Finished difference Result 1330 states and 2091 transitions. [2019-11-15 23:26:26,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:26,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-15 23:26:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:26,031 INFO L225 Difference]: With dead ends: 1330 [2019-11-15 23:26:26,031 INFO L226 Difference]: Without dead ends: 740 [2019-11-15 23:26:26,036 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-11-15 23:26:26,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 720. [2019-11-15 23:26:26,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-15 23:26:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1142 transitions. [2019-11-15 23:26:26,066 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1142 transitions. Word has length 41 [2019-11-15 23:26:26,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:26,067 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1142 transitions. [2019-11-15 23:26:26,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1142 transitions. [2019-11-15 23:26:26,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:26:26,069 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:26,069 INFO L380 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] [2019-11-15 23:26:26,070 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:26,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1323716310, now seen corresponding path program 1 times [2019-11-15 23:26:26,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:26,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183786770] [2019-11-15 23:26:26,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:26,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:26,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:26,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183786770] [2019-11-15 23:26:26,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:26,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:26:26,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999326855] [2019-11-15 23:26:26,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:26,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:26,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:26,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:26,115 INFO L87 Difference]: Start difference. First operand 720 states and 1142 transitions. Second operand 3 states. [2019-11-15 23:26:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:26,304 INFO L93 Difference]: Finished difference Result 1497 states and 2391 transitions. [2019-11-15 23:26:26,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:26,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-15 23:26:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:26,310 INFO L225 Difference]: With dead ends: 1497 [2019-11-15 23:26:26,310 INFO L226 Difference]: Without dead ends: 785 [2019-11-15 23:26:26,311 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:26,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-11-15 23:26:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 765. [2019-11-15 23:26:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-11-15 23:26:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1227 transitions. [2019-11-15 23:26:26,341 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1227 transitions. Word has length 42 [2019-11-15 23:26:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:26,341 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1227 transitions. [2019-11-15 23:26:26,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1227 transitions. [2019-11-15 23:26:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 23:26:26,343 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:26,343 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:26:26,343 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:26,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:26,343 INFO L82 PathProgramCache]: Analyzing trace with hash 477806323, now seen corresponding path program 1 times [2019-11-15 23:26:26,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:26,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830493342] [2019-11-15 23:26:26,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:26,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:26,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:26,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830493342] [2019-11-15 23:26:26,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:26,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:26:26,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321200219] [2019-11-15 23:26:26,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:26,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:26,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:26,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:26,366 INFO L87 Difference]: Start difference. First operand 765 states and 1227 transitions. Second operand 3 states. [2019-11-15 23:26:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:26,389 INFO L93 Difference]: Finished difference Result 1522 states and 2442 transitions. [2019-11-15 23:26:26,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:26,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-15 23:26:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:26,394 INFO L225 Difference]: With dead ends: 1522 [2019-11-15 23:26:26,394 INFO L226 Difference]: Without dead ends: 765 [2019-11-15 23:26:26,395 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-11-15 23:26:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2019-11-15 23:26:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-11-15 23:26:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1210 transitions. [2019-11-15 23:26:26,423 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1210 transitions. Word has length 43 [2019-11-15 23:26:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:26,423 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1210 transitions. [2019-11-15 23:26:26,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1210 transitions. [2019-11-15 23:26:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:26:26,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:26,424 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:26:26,425 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:26,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:26,425 INFO L82 PathProgramCache]: Analyzing trace with hash -701855575, now seen corresponding path program 1 times [2019-11-15 23:26:26,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:26,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671967909] [2019-11-15 23:26:26,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:26,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:26,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:26,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671967909] [2019-11-15 23:26:26,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:26,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:26:26,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997451127] [2019-11-15 23:26:26,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:26,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:26,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:26,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:26,477 INFO L87 Difference]: Start difference. First operand 765 states and 1210 transitions. Second operand 3 states. [2019-11-15 23:26:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:26,513 INFO L93 Difference]: Finished difference Result 1536 states and 2425 transitions. [2019-11-15 23:26:26,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:26,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 23:26:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:26,518 INFO L225 Difference]: With dead ends: 1536 [2019-11-15 23:26:26,519 INFO L226 Difference]: Without dead ends: 779 [2019-11-15 23:26:26,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-15 23:26:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2019-11-15 23:26:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-15 23:26:26,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1208 transitions. [2019-11-15 23:26:26,550 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1208 transitions. Word has length 44 [2019-11-15 23:26:26,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:26,550 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1208 transitions. [2019-11-15 23:26:26,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1208 transitions. [2019-11-15 23:26:26,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:26:26,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:26,552 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:26:26,552 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:26,552 INFO L82 PathProgramCache]: Analyzing trace with hash 616075766, now seen corresponding path program 1 times [2019-11-15 23:26:26,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:26,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377863368] [2019-11-15 23:26:26,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:26,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:26,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:26,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377863368] [2019-11-15 23:26:26,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:26,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:26:26,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610401947] [2019-11-15 23:26:26,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:26,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:26,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:26,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:26,577 INFO L87 Difference]: Start difference. First operand 777 states and 1208 transitions. Second operand 3 states. [2019-11-15 23:26:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:26,626 INFO L93 Difference]: Finished difference Result 2298 states and 3572 transitions. [2019-11-15 23:26:26,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:26,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 23:26:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:26,635 INFO L225 Difference]: With dead ends: 2298 [2019-11-15 23:26:26,635 INFO L226 Difference]: Without dead ends: 1529 [2019-11-15 23:26:26,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:26,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2019-11-15 23:26:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1217. [2019-11-15 23:26:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-15 23:26:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1884 transitions. [2019-11-15 23:26:26,688 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1884 transitions. Word has length 49 [2019-11-15 23:26:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:26,689 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1884 transitions. [2019-11-15 23:26:26,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:26,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1884 transitions. [2019-11-15 23:26:26,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:26:26,691 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:26,691 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:26:26,691 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:26,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:26,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1509562104, now seen corresponding path program 1 times [2019-11-15 23:26:26,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:26,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113622461] [2019-11-15 23:26:26,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:26,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:26,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:26,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113622461] [2019-11-15 23:26:26,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:26,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:26:26,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970680339] [2019-11-15 23:26:26,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:26,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:26,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:26,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:26,719 INFO L87 Difference]: Start difference. First operand 1217 states and 1884 transitions. Second operand 3 states. [2019-11-15 23:26:26,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:26,922 INFO L93 Difference]: Finished difference Result 2638 states and 4072 transitions. [2019-11-15 23:26:26,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:26,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 23:26:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:26,931 INFO L225 Difference]: With dead ends: 2638 [2019-11-15 23:26:26,931 INFO L226 Difference]: Without dead ends: 1430 [2019-11-15 23:26:26,933 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-11-15 23:26:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1324. [2019-11-15 23:26:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2019-11-15 23:26:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1999 transitions. [2019-11-15 23:26:26,987 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1999 transitions. Word has length 49 [2019-11-15 23:26:26,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:26,987 INFO L462 AbstractCegarLoop]: Abstraction has 1324 states and 1999 transitions. [2019-11-15 23:26:26,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1999 transitions. [2019-11-15 23:26:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:26:26,989 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:26,990 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:26:26,990 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:26,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:26,990 INFO L82 PathProgramCache]: Analyzing trace with hash 531471331, now seen corresponding path program 1 times [2019-11-15 23:26:26,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:26,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553250239] [2019-11-15 23:26:26,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:26,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:26,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:26:27,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553250239] [2019-11-15 23:26:27,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:27,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:26:27,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093268107] [2019-11-15 23:26:27,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:27,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:27,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:27,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:27,020 INFO L87 Difference]: Start difference. First operand 1324 states and 1999 transitions. Second operand 3 states. [2019-11-15 23:26:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:27,077 INFO L93 Difference]: Finished difference Result 2486 states and 3735 transitions. [2019-11-15 23:26:27,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:27,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-15 23:26:27,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:27,087 INFO L225 Difference]: With dead ends: 2486 [2019-11-15 23:26:27,087 INFO L226 Difference]: Without dead ends: 1659 [2019-11-15 23:26:27,088 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:27,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2019-11-15 23:26:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1185. [2019-11-15 23:26:27,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-11-15 23:26:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1780 transitions. [2019-11-15 23:26:27,141 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1780 transitions. Word has length 54 [2019-11-15 23:26:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:27,142 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 1780 transitions. [2019-11-15 23:26:27,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1780 transitions. [2019-11-15 23:26:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:26:27,144 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:27,144 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:26:27,144 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:27,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:27,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1599732210, now seen corresponding path program 1 times [2019-11-15 23:26:27,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:27,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546429329] [2019-11-15 23:26:27,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:27,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:27,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:27,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546429329] [2019-11-15 23:26:27,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:27,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:26:27,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912403466] [2019-11-15 23:26:27,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:27,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:27,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:27,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:27,181 INFO L87 Difference]: Start difference. First operand 1185 states and 1780 transitions. Second operand 3 states. [2019-11-15 23:26:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:27,261 INFO L93 Difference]: Finished difference Result 3421 states and 5102 transitions. [2019-11-15 23:26:27,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:27,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-15 23:26:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:27,274 INFO L225 Difference]: With dead ends: 3421 [2019-11-15 23:26:27,275 INFO L226 Difference]: Without dead ends: 2245 [2019-11-15 23:26:27,277 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:27,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-11-15 23:26:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2243. [2019-11-15 23:26:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2019-11-15 23:26:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 3304 transitions. [2019-11-15 23:26:27,374 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 3304 transitions. Word has length 55 [2019-11-15 23:26:27,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:27,374 INFO L462 AbstractCegarLoop]: Abstraction has 2243 states and 3304 transitions. [2019-11-15 23:26:27,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 3304 transitions. [2019-11-15 23:26:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:26:27,379 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:27,379 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:26:27,379 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1445576834, now seen corresponding path program 1 times [2019-11-15 23:26:27,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:27,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468901588] [2019-11-15 23:26:27,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:27,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:27,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:27,430 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:27,431 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:26:27,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:26:27 BoogieIcfgContainer [2019-11-15 23:26:27,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:26:27,507 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:26:27,507 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:26:27,508 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:26:27,508 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:23" (3/4) ... [2019-11-15 23:26:27,511 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:26:27,619 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_eb0d9205-c62e-4713-a03f-399be7b3613c/bin/uautomizer/witness.graphml [2019-11-15 23:26:27,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:26:27,622 INFO L168 Benchmark]: Toolchain (without parser) took 5864.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 944.7 MB in the beginning and 866.0 MB in the end (delta: 78.7 MB). Peak memory consumption was 254.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:27,622 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:26:27,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 483.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:27,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:26:27,623 INFO L168 Benchmark]: Boogie Preprocessor took 74.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:27,624 INFO L168 Benchmark]: RCFGBuilder took 917.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:27,624 INFO L168 Benchmark]: TraceAbstraction took 4200.75 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.0 GB in the beginning and 881.0 MB in the end (delta: 162.4 MB). Peak memory consumption was 218.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:27,625 INFO L168 Benchmark]: Witness Printer took 112.82 ms. Allocated memory is still 1.2 GB. Free memory was 881.0 MB in the beginning and 866.0 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:27,626 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 483.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 917.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4200.75 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.0 GB in the beginning and 881.0 MB in the end (delta: 162.4 MB). Peak memory consumption was 218.0 MB. Max. memory is 11.5 GB. * Witness Printer took 112.82 ms. Allocated memory is still 1.2 GB. Free memory was 881.0 MB in the beginning and 866.0 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 640]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L645] int s ; [L646] int tmp ; [L650] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L40] int s__session__cipher ; [L41] int buf ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp ; [L45] int cb ; [L46] long num1 = __VERIFIER_nondet_long() ; [L47] int ret ; [L48] int new_state ; [L49] int state ; [L50] int skip ; [L51] int got_new_session ; [L52] int tmp___1 = __VERIFIER_nondet_int() ; [L53] int tmp___2 = __VERIFIER_nondet_int() ; [L54] int tmp___3 = __VERIFIER_nondet_int() ; [L55] int tmp___4 = __VERIFIER_nondet_int() ; [L56] int tmp___5 = __VERIFIER_nondet_int() ; [L57] int tmp___6 = __VERIFIER_nondet_int() ; [L58] int tmp___7 ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 = __VERIFIER_nondet_int() ; [L61] int tmp___10 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L72] s__s3__tmp__reuse_message = 0 [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND TRUE tmp___1 + 12288 [L90] COND TRUE tmp___2 + 16384 [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE s__state != 8656 [L606] COND TRUE tmp___2 != -16384 [L607] COND FALSE !(state == 8496) [L614] COND FALSE !(\read(s__debug)) [L620] COND TRUE cb != 0 [L621] COND TRUE s__state != state [L622] new_state = s__state [L623] s__state = state [L624] s__state = new_state [L629] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 8512 [L297] s__init_num = 0 [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE s__state != 8656 [L606] COND TRUE tmp___2 != -16384 [L607] COND TRUE state == 8496 [L640] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.1s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3434 SDtfs, 3298 SDslu, 1317 SDs, 0 SdLazy, 1077 SolverSat, 427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2243occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 1140 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 652 NumberOfCodeBlocks, 652 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 70785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 102/102 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...