./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/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 a85198d3f93b8c751f2c6e712deab62f97c1022f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/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 a85198d3f93b8c751f2c6e712deab62f97c1022f .............................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:48:36,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:48:36,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:48:36,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:48:36,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:48:36,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:48:36,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:48:36,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:48:36,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:48:36,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:48:36,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:48:36,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:48:36,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:48:36,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:48:36,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:48:36,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:48:36,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:48:36,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:48:36,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:48:36,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:48:36,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:48:36,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:48:36,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:48:36,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:48:36,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:48:36,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:48:36,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:48:36,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:48:36,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:48:36,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:48:36,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:48:36,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:48:36,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:48:36,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:48:36,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:48:36,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:48:36,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:48:36,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:48:36,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:48:36,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:48:36,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:48:36,920 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:48:36,943 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:48:36,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:48:36,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:48:36,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:48:36,954 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:48:36,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:48:36,955 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:48:36,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:48:36,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:48:36,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:48:36,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:48:36,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:48:36,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:48:36,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:48:36,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:48:36,957 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:48:36,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:48:36,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:48:36,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:48:36,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:48:36,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:48:36,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:48:36,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:48:36,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:48:36,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:48:36,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:48:36,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:48:36,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:48:36,960 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_fe0eb1a2-43e8-46f6-9d00-1d3803301970/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 -> a85198d3f93b8c751f2c6e712deab62f97c1022f [2019-11-25 08:48:37,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:48:37,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:48:37,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:48:37,143 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:48:37,144 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:48:37,144 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-25 08:48:37,195 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/data/4454219d0/257c9b45ba564c41ab27dfa67896660c/FLAG77418f431 [2019-11-25 08:48:37,721 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:48:37,722 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-25 08:48:37,741 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/data/4454219d0/257c9b45ba564c41ab27dfa67896660c/FLAG77418f431 [2019-11-25 08:48:38,214 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/data/4454219d0/257c9b45ba564c41ab27dfa67896660c [2019-11-25 08:48:38,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:48:38,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:48:38,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:48:38,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:48:38,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:48:38,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:48:38" (1/1) ... [2019-11-25 08:48:38,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e592e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:38, skipping insertion in model container [2019-11-25 08:48:38,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:48:38" (1/1) ... [2019-11-25 08:48:38,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:48:38,309 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:48:38,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:48:38,826 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:48:38,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:48:38,946 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:48:38,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:38 WrapperNode [2019-11-25 08:48:38,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:48:38,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:48:38,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:48:38,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:48:38,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:38" (1/1) ... [2019-11-25 08:48:38,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:38" (1/1) ... [2019-11-25 08:48:39,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:48:39,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:48:39,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:48:39,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:48:39,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:38" (1/1) ... [2019-11-25 08:48:39,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:38" (1/1) ... [2019-11-25 08:48:39,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:38" (1/1) ... [2019-11-25 08:48:39,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:38" (1/1) ... [2019-11-25 08:48:39,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:38" (1/1) ... [2019-11-25 08:48:39,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:38" (1/1) ... [2019-11-25 08:48:39,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:38" (1/1) ... [2019-11-25 08:48:39,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:48:39,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:48:39,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:48:39,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:48:39,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/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-25 08:48:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:48:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:48:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:48:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:48:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:48:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:48:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:48:39,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:48:39,514 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:48:40,464 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-25 08:48:40,464 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-25 08:48:40,465 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:48:40,466 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:48:40,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:40 BoogieIcfgContainer [2019-11-25 08:48:40,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:48:40,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:48:40,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:48:40,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:48:40,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:48:38" (1/3) ... [2019-11-25 08:48:40,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d664b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:48:40, skipping insertion in model container [2019-11-25 08:48:40,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:38" (2/3) ... [2019-11-25 08:48:40,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d664b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:48:40, skipping insertion in model container [2019-11-25 08:48:40,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:40" (3/3) ... [2019-11-25 08:48:40,473 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-11-25 08:48:40,483 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:48:40,490 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:48:40,502 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:48:40,524 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:48:40,524 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:48:40,525 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:48:40,525 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:48:40,525 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:48:40,525 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:48:40,525 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:48:40,525 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:48:40,544 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-25 08:48:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:48:40,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:40,553 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:40,553 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:40,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:40,559 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-25 08:48:40,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:40,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806911577] [2019-11-25 08:48:40,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:40,948 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-25 08:48:40,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806911577] [2019-11-25 08:48:40,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:40,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:40,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425335977] [2019-11-25 08:48:40,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:40,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:40,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:40,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:40,973 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-25 08:48:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:41,466 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-11-25 08:48:41,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:41,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-25 08:48:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:41,480 INFO L225 Difference]: With dead ends: 313 [2019-11-25 08:48:41,481 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 08:48:41,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:41,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 08:48:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-25 08:48:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:48:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-11-25 08:48:41,531 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-11-25 08:48:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:41,531 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-11-25 08:48:41,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-11-25 08:48:41,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-25 08:48:41,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:41,535 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:41,535 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:41,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:41,536 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-11-25 08:48:41,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:41,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291055264] [2019-11-25 08:48:41,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:41,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291055264] [2019-11-25 08:48:41,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:41,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:41,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347548318] [2019-11-25 08:48:41,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:41,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:41,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:41,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:41,652 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-11-25 08:48:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:42,055 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-11-25 08:48:42,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:42,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-25 08:48:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:42,057 INFO L225 Difference]: With dead ends: 280 [2019-11-25 08:48:42,057 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 08:48:42,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 08:48:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-25 08:48:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:48:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-11-25 08:48:42,079 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-11-25 08:48:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:42,080 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-11-25 08:48:42,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-11-25 08:48:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:48:42,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:42,090 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:42,090 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:42,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:42,091 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-11-25 08:48:42,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:42,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042555126] [2019-11-25 08:48:42,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:42,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042555126] [2019-11-25 08:48:42,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:42,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:42,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80110514] [2019-11-25 08:48:42,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:42,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:42,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:42,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:42,258 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-11-25 08:48:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:42,581 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-11-25 08:48:42,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:42,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:48:42,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:42,584 INFO L225 Difference]: With dead ends: 279 [2019-11-25 08:48:42,584 INFO L226 Difference]: Without dead ends: 157 [2019-11-25 08:48:42,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-25 08:48:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-11-25 08:48:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:48:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-11-25 08:48:42,594 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-11-25 08:48:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:42,594 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-11-25 08:48:42,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-11-25 08:48:42,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:48:42,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:42,596 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:42,596 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:42,597 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-11-25 08:48:42,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:42,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436320450] [2019-11-25 08:48:42,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:42,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436320450] [2019-11-25 08:48:42,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:42,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:42,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626291769] [2019-11-25 08:48:42,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:42,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:42,685 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-11-25 08:48:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:43,010 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-11-25 08:48:43,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:43,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:48:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:43,012 INFO L225 Difference]: With dead ends: 277 [2019-11-25 08:48:43,012 INFO L226 Difference]: Without dead ends: 155 [2019-11-25 08:48:43,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-25 08:48:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-11-25 08:48:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:48:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-11-25 08:48:43,021 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-11-25 08:48:43,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:43,021 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-11-25 08:48:43,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:43,021 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-11-25 08:48:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:48:43,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:43,028 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:43,028 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:43,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-11-25 08:48:43,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:43,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767655171] [2019-11-25 08:48:43,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:43,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767655171] [2019-11-25 08:48:43,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:43,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:43,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985143754] [2019-11-25 08:48:43,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:43,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:43,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:43,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:43,128 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-11-25 08:48:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:43,446 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-11-25 08:48:43,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:43,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:48:43,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:43,448 INFO L225 Difference]: With dead ends: 276 [2019-11-25 08:48:43,449 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 08:48:43,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:43,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 08:48:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-25 08:48:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:48:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-11-25 08:48:43,458 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-11-25 08:48:43,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:43,458 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-11-25 08:48:43,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-11-25 08:48:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:48:43,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:43,463 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:43,464 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:43,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:43,464 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-11-25 08:48:43,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:43,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892816021] [2019-11-25 08:48:43,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:43,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892816021] [2019-11-25 08:48:43,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:43,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:43,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467513187] [2019-11-25 08:48:43,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:43,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:43,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:43,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:43,541 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-11-25 08:48:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:43,856 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-11-25 08:48:43,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:43,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:48:43,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:43,858 INFO L225 Difference]: With dead ends: 276 [2019-11-25 08:48:43,858 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 08:48:43,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 08:48:43,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-25 08:48:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:48:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-11-25 08:48:43,866 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-11-25 08:48:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:43,867 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-11-25 08:48:43,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-11-25 08:48:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-25 08:48:43,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:43,868 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:43,868 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:43,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:43,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-11-25 08:48:43,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:43,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099186458] [2019-11-25 08:48:43,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:43,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099186458] [2019-11-25 08:48:43,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:43,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:43,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851042306] [2019-11-25 08:48:43,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:43,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:43,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:43,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:43,926 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-11-25 08:48:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:44,195 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-25 08:48:44,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:44,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-25 08:48:44,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:44,197 INFO L225 Difference]: With dead ends: 276 [2019-11-25 08:48:44,197 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 08:48:44,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:44,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 08:48:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-25 08:48:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:48:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-11-25 08:48:44,204 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-11-25 08:48:44,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:44,204 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-11-25 08:48:44,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-11-25 08:48:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-25 08:48:44,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:44,206 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:44,206 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:44,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:44,206 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-11-25 08:48:44,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:44,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354633756] [2019-11-25 08:48:44,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:44,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354633756] [2019-11-25 08:48:44,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:44,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:44,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292263013] [2019-11-25 08:48:44,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:44,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:44,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:44,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:44,267 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-11-25 08:48:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:44,598 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-11-25 08:48:44,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:44,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-25 08:48:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:44,600 INFO L225 Difference]: With dead ends: 276 [2019-11-25 08:48:44,600 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 08:48:44,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:44,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 08:48:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-25 08:48:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:48:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-11-25 08:48:44,606 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-11-25 08:48:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:44,606 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-11-25 08:48:44,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-11-25 08:48:44,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-25 08:48:44,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:44,607 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:44,607 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:44,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:44,608 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-11-25 08:48:44,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:44,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308561148] [2019-11-25 08:48:44,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:44,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308561148] [2019-11-25 08:48:44,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:44,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:44,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906404465] [2019-11-25 08:48:44,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:44,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:44,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:44,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:44,697 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-11-25 08:48:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:44,958 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-11-25 08:48:44,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:44,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-25 08:48:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:44,960 INFO L225 Difference]: With dead ends: 266 [2019-11-25 08:48:44,960 INFO L226 Difference]: Without dead ends: 144 [2019-11-25 08:48:44,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-25 08:48:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-11-25 08:48:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:48:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-11-25 08:48:44,965 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-11-25 08:48:44,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:44,965 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-11-25 08:48:44,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:44,966 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-11-25 08:48:44,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-25 08:48:44,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:44,967 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:44,967 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:44,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:44,967 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-11-25 08:48:44,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:44,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937691446] [2019-11-25 08:48:44,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:45,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937691446] [2019-11-25 08:48:45,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:45,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:45,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568248288] [2019-11-25 08:48:45,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:45,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:45,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:45,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:45,022 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-11-25 08:48:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:45,335 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2019-11-25 08:48:45,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:45,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-25 08:48:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:45,337 INFO L225 Difference]: With dead ends: 306 [2019-11-25 08:48:45,337 INFO L226 Difference]: Without dead ends: 184 [2019-11-25 08:48:45,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-25 08:48:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-25 08:48:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:48:45,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-11-25 08:48:45,348 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-11-25 08:48:45,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:45,348 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-11-25 08:48:45,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-11-25 08:48:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-25 08:48:45,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:45,349 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:45,350 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:45,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:45,350 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-11-25 08:48:45,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:45,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464277815] [2019-11-25 08:48:45,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:45,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464277815] [2019-11-25 08:48:45,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:45,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:45,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130697537] [2019-11-25 08:48:45,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:45,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:45,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:45,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:45,424 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-11-25 08:48:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:45,747 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2019-11-25 08:48:45,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:45,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-25 08:48:45,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:45,749 INFO L225 Difference]: With dead ends: 328 [2019-11-25 08:48:45,749 INFO L226 Difference]: Without dead ends: 184 [2019-11-25 08:48:45,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-25 08:48:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-25 08:48:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:48:45,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-11-25 08:48:45,755 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-11-25 08:48:45,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:45,756 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-11-25 08:48:45,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-11-25 08:48:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:48:45,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:45,757 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:45,757 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:45,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:45,757 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-11-25 08:48:45,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:45,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195616206] [2019-11-25 08:48:45,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:45,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195616206] [2019-11-25 08:48:45,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:45,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:45,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283162840] [2019-11-25 08:48:45,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:45,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:45,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:45,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:45,800 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-11-25 08:48:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:46,123 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2019-11-25 08:48:46,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:46,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-25 08:48:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:46,125 INFO L225 Difference]: With dead ends: 327 [2019-11-25 08:48:46,126 INFO L226 Difference]: Without dead ends: 183 [2019-11-25 08:48:46,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:46,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-25 08:48:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2019-11-25 08:48:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:48:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-11-25 08:48:46,135 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-11-25 08:48:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:46,136 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-11-25 08:48:46,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-11-25 08:48:46,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:48:46,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:46,137 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:46,137 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:46,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:46,138 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-11-25 08:48:46,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:46,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442950636] [2019-11-25 08:48:46,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:46,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442950636] [2019-11-25 08:48:46,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:46,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:46,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975664915] [2019-11-25 08:48:46,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:46,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:46,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:46,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:46,187 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-11-25 08:48:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:46,480 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2019-11-25 08:48:46,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:46,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-25 08:48:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:46,482 INFO L225 Difference]: With dead ends: 325 [2019-11-25 08:48:46,482 INFO L226 Difference]: Without dead ends: 181 [2019-11-25 08:48:46,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-25 08:48:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-25 08:48:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:48:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-11-25 08:48:46,489 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-11-25 08:48:46,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:46,489 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-11-25 08:48:46,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-11-25 08:48:46,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:48:46,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:46,491 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:46,491 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:46,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:46,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-11-25 08:48:46,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:46,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079481730] [2019-11-25 08:48:46,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:46,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079481730] [2019-11-25 08:48:46,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:46,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:46,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598326311] [2019-11-25 08:48:46,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:46,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:46,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:46,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:46,547 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-11-25 08:48:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:46,815 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2019-11-25 08:48:46,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:46,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-25 08:48:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:46,817 INFO L225 Difference]: With dead ends: 324 [2019-11-25 08:48:46,817 INFO L226 Difference]: Without dead ends: 180 [2019-11-25 08:48:46,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-25 08:48:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-25 08:48:46,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:48:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-25 08:48:46,823 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-11-25 08:48:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:46,823 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-25 08:48:46,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-25 08:48:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:48:46,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:46,824 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:46,824 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:46,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:46,825 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-11-25 08:48:46,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:46,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008692874] [2019-11-25 08:48:46,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:46,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008692874] [2019-11-25 08:48:46,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:46,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:46,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139722154] [2019-11-25 08:48:46,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:46,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:46,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:46,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:46,872 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-11-25 08:48:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:47,164 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2019-11-25 08:48:47,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:47,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-25 08:48:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:47,166 INFO L225 Difference]: With dead ends: 324 [2019-11-25 08:48:47,166 INFO L226 Difference]: Without dead ends: 180 [2019-11-25 08:48:47,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-25 08:48:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-25 08:48:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:48:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-11-25 08:48:47,176 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-11-25 08:48:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:47,176 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-11-25 08:48:47,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-11-25 08:48:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-25 08:48:47,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:47,177 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:47,177 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:47,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:47,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-11-25 08:48:47,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:47,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944575343] [2019-11-25 08:48:47,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:47,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944575343] [2019-11-25 08:48:47,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:47,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:47,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029059815] [2019-11-25 08:48:47,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:47,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:47,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:47,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:47,236 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-11-25 08:48:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:47,600 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-11-25 08:48:47,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:47,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-25 08:48:47,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:47,601 INFO L225 Difference]: With dead ends: 324 [2019-11-25 08:48:47,601 INFO L226 Difference]: Without dead ends: 180 [2019-11-25 08:48:47,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:47,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-25 08:48:47,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-25 08:48:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:48:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-11-25 08:48:47,607 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-11-25 08:48:47,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:47,607 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-11-25 08:48:47,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-11-25 08:48:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-25 08:48:47,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:47,609 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:47,609 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:47,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:47,609 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-11-25 08:48:47,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:47,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989176142] [2019-11-25 08:48:47,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:47,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989176142] [2019-11-25 08:48:47,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:47,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:47,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106406677] [2019-11-25 08:48:47,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:47,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:47,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:47,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:47,662 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-11-25 08:48:47,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:47,976 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2019-11-25 08:48:47,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:47,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-25 08:48:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:47,979 INFO L225 Difference]: With dead ends: 324 [2019-11-25 08:48:47,979 INFO L226 Difference]: Without dead ends: 180 [2019-11-25 08:48:47,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-25 08:48:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-25 08:48:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:48:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-11-25 08:48:47,984 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-11-25 08:48:47,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:47,985 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-11-25 08:48:47,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-11-25 08:48:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-25 08:48:47,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:47,987 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:47,987 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:47,987 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-11-25 08:48:47,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:47,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695876583] [2019-11-25 08:48:47,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:48,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695876583] [2019-11-25 08:48:48,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:48,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:48,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574514060] [2019-11-25 08:48:48,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:48,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:48,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:48,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:48,042 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-11-25 08:48:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:48,298 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-11-25 08:48:48,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:48,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-25 08:48:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:48,300 INFO L225 Difference]: With dead ends: 314 [2019-11-25 08:48:48,300 INFO L226 Difference]: Without dead ends: 170 [2019-11-25 08:48:48,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-25 08:48:48,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2019-11-25 08:48:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:48:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-11-25 08:48:48,305 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-11-25 08:48:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:48,305 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-11-25 08:48:48,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-11-25 08:48:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:48:48,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:48,307 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:48,307 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:48,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:48,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1124223160, now seen corresponding path program 1 times [2019-11-25 08:48:48,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:48,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107580462] [2019-11-25 08:48:48,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:48,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107580462] [2019-11-25 08:48:48,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:48,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:48,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237556851] [2019-11-25 08:48:48,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:48,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:48,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:48,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:48,379 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-11-25 08:48:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:48,801 INFO L93 Difference]: Finished difference Result 402 states and 601 transitions. [2019-11-25 08:48:48,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:48,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-25 08:48:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:48,803 INFO L225 Difference]: With dead ends: 402 [2019-11-25 08:48:48,804 INFO L226 Difference]: Without dead ends: 258 [2019-11-25 08:48:48,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-25 08:48:48,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 206. [2019-11-25 08:48:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-25 08:48:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-11-25 08:48:48,811 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-11-25 08:48:48,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:48,811 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-11-25 08:48:48,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-11-25 08:48:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:48:48,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:48,813 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:48,813 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:48,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:48,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2021616438, now seen corresponding path program 1 times [2019-11-25 08:48:48,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:48,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694634226] [2019-11-25 08:48:48,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:48,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694634226] [2019-11-25 08:48:48,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:48,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:48,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912231155] [2019-11-25 08:48:48,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:48,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:48,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:48,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:48,916 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-11-25 08:48:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:49,307 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2019-11-25 08:48:49,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:49,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-25 08:48:49,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:49,309 INFO L225 Difference]: With dead ends: 442 [2019-11-25 08:48:49,309 INFO L226 Difference]: Without dead ends: 255 [2019-11-25 08:48:49,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-25 08:48:49,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-25 08:48:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:48:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-11-25 08:48:49,317 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-11-25 08:48:49,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:49,317 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-11-25 08:48:49,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-11-25 08:48:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-25 08:48:49,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:49,319 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:49,319 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:49,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:49,319 INFO L82 PathProgramCache]: Analyzing trace with hash -344765763, now seen corresponding path program 1 times [2019-11-25 08:48:49,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:49,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666993949] [2019-11-25 08:48:49,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:49,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666993949] [2019-11-25 08:48:49,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:49,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:49,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557361219] [2019-11-25 08:48:49,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:49,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:49,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:49,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:49,395 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-11-25 08:48:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:49,741 INFO L93 Difference]: Finished difference Result 493 states and 762 transitions. [2019-11-25 08:48:49,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:49,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-25 08:48:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:49,743 INFO L225 Difference]: With dead ends: 493 [2019-11-25 08:48:49,743 INFO L226 Difference]: Without dead ends: 282 [2019-11-25 08:48:49,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-25 08:48:49,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-11-25 08:48:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:48:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-11-25 08:48:49,750 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-11-25 08:48:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:49,750 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-11-25 08:48:49,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-11-25 08:48:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-25 08:48:49,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:49,752 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:49,752 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:49,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:49,752 INFO L82 PathProgramCache]: Analyzing trace with hash -304091013, now seen corresponding path program 1 times [2019-11-25 08:48:49,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:49,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785277056] [2019-11-25 08:48:49,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:49,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785277056] [2019-11-25 08:48:49,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:49,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:49,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547419231] [2019-11-25 08:48:49,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:49,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:49,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:49,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:49,818 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-11-25 08:48:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:50,173 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2019-11-25 08:48:50,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:50,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-25 08:48:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:50,177 INFO L225 Difference]: With dead ends: 466 [2019-11-25 08:48:50,177 INFO L226 Difference]: Without dead ends: 255 [2019-11-25 08:48:50,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-25 08:48:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-25 08:48:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:48:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-11-25 08:48:50,185 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-11-25 08:48:50,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:50,186 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-11-25 08:48:50,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-11-25 08:48:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:48:50,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:50,187 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:50,188 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:50,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:50,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1789653831, now seen corresponding path program 1 times [2019-11-25 08:48:50,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:50,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671878200] [2019-11-25 08:48:50,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:50,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671878200] [2019-11-25 08:48:50,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:50,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:50,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141950468] [2019-11-25 08:48:50,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:50,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:50,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:50,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:50,258 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-11-25 08:48:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:50,705 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2019-11-25 08:48:50,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:50,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:48:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:50,707 INFO L225 Difference]: With dead ends: 492 [2019-11-25 08:48:50,707 INFO L226 Difference]: Without dead ends: 281 [2019-11-25 08:48:50,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-25 08:48:50,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2019-11-25 08:48:50,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:48:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-11-25 08:48:50,715 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-11-25 08:48:50,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:50,715 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-11-25 08:48:50,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:50,716 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-11-25 08:48:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:48:50,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:50,717 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:50,717 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:50,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:50,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1162120014, now seen corresponding path program 1 times [2019-11-25 08:48:50,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:50,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920574433] [2019-11-25 08:48:50,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:50,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920574433] [2019-11-25 08:48:50,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:50,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:50,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299267230] [2019-11-25 08:48:50,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:50,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:50,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:50,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:50,783 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-11-25 08:48:51,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:51,241 INFO L93 Difference]: Finished difference Result 490 states and 753 transitions. [2019-11-25 08:48:51,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:51,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:48:51,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:51,243 INFO L225 Difference]: With dead ends: 490 [2019-11-25 08:48:51,243 INFO L226 Difference]: Without dead ends: 279 [2019-11-25 08:48:51,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-25 08:48:51,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-11-25 08:48:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:48:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-11-25 08:48:51,253 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-11-25 08:48:51,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:51,253 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-11-25 08:48:51,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-11-25 08:48:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:48:51,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:51,255 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:51,255 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:51,256 INFO L82 PathProgramCache]: Analyzing trace with hash -212771854, now seen corresponding path program 1 times [2019-11-25 08:48:51,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:51,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099119251] [2019-11-25 08:48:51,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:51,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099119251] [2019-11-25 08:48:51,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:51,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:51,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891674576] [2019-11-25 08:48:51,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:51,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:51,335 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-11-25 08:48:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:51,836 INFO L93 Difference]: Finished difference Result 489 states and 750 transitions. [2019-11-25 08:48:51,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:51,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:48:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:51,837 INFO L225 Difference]: With dead ends: 489 [2019-11-25 08:48:51,838 INFO L226 Difference]: Without dead ends: 278 [2019-11-25 08:48:51,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-25 08:48:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2019-11-25 08:48:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:48:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-11-25 08:48:51,844 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-11-25 08:48:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:51,844 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-11-25 08:48:51,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-11-25 08:48:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:48:51,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:51,846 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:51,846 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:51,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:51,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1667302693, now seen corresponding path program 1 times [2019-11-25 08:48:51,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:51,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867257992] [2019-11-25 08:48:51,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-25 08:48:51,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867257992] [2019-11-25 08:48:51,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:51,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:48:51,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752375310] [2019-11-25 08:48:51,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:48:51,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:51,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:48:51,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:51,936 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-11-25 08:48:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:52,426 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-11-25 08:48:52,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:48:52,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-25 08:48:52,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:52,428 INFO L225 Difference]: With dead ends: 462 [2019-11-25 08:48:52,428 INFO L226 Difference]: Without dead ends: 251 [2019-11-25 08:48:52,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:48:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-25 08:48:52,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-11-25 08:48:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:48:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-11-25 08:48:52,435 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-11-25 08:48:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:52,436 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-11-25 08:48:52,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:48:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-11-25 08:48:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:48:52,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:52,437 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:52,437 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:52,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:52,438 INFO L82 PathProgramCache]: Analyzing trace with hash 98797236, now seen corresponding path program 1 times [2019-11-25 08:48:52,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:52,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346664902] [2019-11-25 08:48:52,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:52,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346664902] [2019-11-25 08:48:52,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:52,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:52,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056877399] [2019-11-25 08:48:52,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:52,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:52,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:52,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:52,508 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-11-25 08:48:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:52,936 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2019-11-25 08:48:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:52,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:48:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:52,938 INFO L225 Difference]: With dead ends: 503 [2019-11-25 08:48:52,938 INFO L226 Difference]: Without dead ends: 272 [2019-11-25 08:48:52,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:52,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-25 08:48:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-25 08:48:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:48:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-11-25 08:48:52,945 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-11-25 08:48:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:52,946 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-11-25 08:48:52,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-11-25 08:48:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:48:52,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:52,947 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:52,948 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:52,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1048145396, now seen corresponding path program 1 times [2019-11-25 08:48:52,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:52,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589324434] [2019-11-25 08:48:52,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:52,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589324434] [2019-11-25 08:48:52,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:52,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:52,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136094226] [2019-11-25 08:48:52,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:52,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:52,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:52,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:52,999 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-11-25 08:48:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:53,333 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2019-11-25 08:48:53,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:53,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:48:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:53,335 INFO L225 Difference]: With dead ends: 502 [2019-11-25 08:48:53,335 INFO L226 Difference]: Without dead ends: 271 [2019-11-25 08:48:53,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-25 08:48:53,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-25 08:48:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:48:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-11-25 08:48:53,342 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-11-25 08:48:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:53,343 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-11-25 08:48:53,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-11-25 08:48:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:48:53,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:53,344 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:53,345 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:53,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:53,345 INFO L82 PathProgramCache]: Analyzing trace with hash -645348551, now seen corresponding path program 1 times [2019-11-25 08:48:53,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:53,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515328626] [2019-11-25 08:48:53,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:53,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515328626] [2019-11-25 08:48:53,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:53,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:53,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897147264] [2019-11-25 08:48:53,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:53,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:53,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:53,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:53,440 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-11-25 08:48:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:53,919 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2019-11-25 08:48:53,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:53,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-25 08:48:53,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:53,921 INFO L225 Difference]: With dead ends: 529 [2019-11-25 08:48:53,921 INFO L226 Difference]: Without dead ends: 298 [2019-11-25 08:48:53,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:53,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-25 08:48:53,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-25 08:48:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:48:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-11-25 08:48:53,929 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-11-25 08:48:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:53,929 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-11-25 08:48:53,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-11-25 08:48:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:48:53,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:53,931 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:53,931 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:53,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:53,931 INFO L82 PathProgramCache]: Analyzing trace with hash -211619465, now seen corresponding path program 1 times [2019-11-25 08:48:53,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:53,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920844018] [2019-11-25 08:48:53,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:53,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920844018] [2019-11-25 08:48:53,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:53,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:53,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112859145] [2019-11-25 08:48:53,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:53,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:53,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:53,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:53,983 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-11-25 08:48:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:54,370 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2019-11-25 08:48:54,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:54,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-25 08:48:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:54,372 INFO L225 Difference]: With dead ends: 502 [2019-11-25 08:48:54,372 INFO L226 Difference]: Without dead ends: 271 [2019-11-25 08:48:54,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-25 08:48:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-25 08:48:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:48:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-11-25 08:48:54,380 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-11-25 08:48:54,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:54,380 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-11-25 08:48:54,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-11-25 08:48:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:48:54,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:54,381 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:54,381 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:54,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:54,382 INFO L82 PathProgramCache]: Analyzing trace with hash -300903122, now seen corresponding path program 1 times [2019-11-25 08:48:54,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:54,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461620034] [2019-11-25 08:48:54,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:54,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461620034] [2019-11-25 08:48:54,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:54,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:54,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205836015] [2019-11-25 08:48:54,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:54,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:54,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:54,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:54,437 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-11-25 08:48:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:54,852 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2019-11-25 08:48:54,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:54,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-25 08:48:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:54,854 INFO L225 Difference]: With dead ends: 529 [2019-11-25 08:48:54,854 INFO L226 Difference]: Without dead ends: 298 [2019-11-25 08:48:54,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-25 08:48:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-25 08:48:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:48:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-11-25 08:48:54,862 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-11-25 08:48:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:54,862 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-11-25 08:48:54,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-11-25 08:48:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:48:54,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:54,863 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:54,863 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:54,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:54,864 INFO L82 PathProgramCache]: Analyzing trace with hash 259796656, now seen corresponding path program 1 times [2019-11-25 08:48:54,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:54,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872019219] [2019-11-25 08:48:54,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:54,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872019219] [2019-11-25 08:48:54,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:54,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:54,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282254634] [2019-11-25 08:48:54,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:54,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:54,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:54,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:54,932 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-11-25 08:48:55,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:55,253 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2019-11-25 08:48:55,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:55,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-25 08:48:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:55,255 INFO L225 Difference]: With dead ends: 502 [2019-11-25 08:48:55,255 INFO L226 Difference]: Without dead ends: 271 [2019-11-25 08:48:55,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-25 08:48:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-25 08:48:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:48:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-11-25 08:48:55,265 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-11-25 08:48:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:55,265 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-11-25 08:48:55,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-11-25 08:48:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-25 08:48:55,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:55,267 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:55,267 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:55,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash 584269940, now seen corresponding path program 1 times [2019-11-25 08:48:55,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:55,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167783170] [2019-11-25 08:48:55,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:55,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167783170] [2019-11-25 08:48:55,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:55,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:55,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931983160] [2019-11-25 08:48:55,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:55,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:55,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:55,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:55,337 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-11-25 08:48:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:55,749 INFO L93 Difference]: Finished difference Result 529 states and 787 transitions. [2019-11-25 08:48:55,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:55,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-25 08:48:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:55,751 INFO L225 Difference]: With dead ends: 529 [2019-11-25 08:48:55,751 INFO L226 Difference]: Without dead ends: 298 [2019-11-25 08:48:55,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-25 08:48:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-25 08:48:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:48:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-11-25 08:48:55,760 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-11-25 08:48:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:55,760 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-11-25 08:48:55,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-11-25 08:48:55,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-25 08:48:55,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:55,762 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:55,762 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:55,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:55,762 INFO L82 PathProgramCache]: Analyzing trace with hash 786093874, now seen corresponding path program 1 times [2019-11-25 08:48:55,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:55,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516463489] [2019-11-25 08:48:55,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:55,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516463489] [2019-11-25 08:48:55,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:55,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:55,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884240832] [2019-11-25 08:48:55,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:55,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:55,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:55,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:55,813 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-11-25 08:48:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:56,144 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2019-11-25 08:48:56,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:56,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-25 08:48:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:56,146 INFO L225 Difference]: With dead ends: 502 [2019-11-25 08:48:56,146 INFO L226 Difference]: Without dead ends: 271 [2019-11-25 08:48:56,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-25 08:48:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-25 08:48:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:48:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-11-25 08:48:56,153 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-11-25 08:48:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:56,154 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-11-25 08:48:56,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-11-25 08:48:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:48:56,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:56,155 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:56,155 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:56,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:56,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1052130441, now seen corresponding path program 1 times [2019-11-25 08:48:56,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:56,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517364743] [2019-11-25 08:48:56,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:56,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517364743] [2019-11-25 08:48:56,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:56,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:56,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240677856] [2019-11-25 08:48:56,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:56,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:56,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:56,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:56,214 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-11-25 08:48:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:56,575 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2019-11-25 08:48:56,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:56,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-25 08:48:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:56,578 INFO L225 Difference]: With dead ends: 519 [2019-11-25 08:48:56,578 INFO L226 Difference]: Without dead ends: 288 [2019-11-25 08:48:56,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-25 08:48:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-11-25 08:48:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:48:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-11-25 08:48:56,587 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-11-25 08:48:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:56,587 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-11-25 08:48:56,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-11-25 08:48:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:48:56,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:56,589 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:56,589 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:56,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1281262197, now seen corresponding path program 1 times [2019-11-25 08:48:56,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:56,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974706953] [2019-11-25 08:48:56,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:56,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974706953] [2019-11-25 08:48:56,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:56,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:56,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192906885] [2019-11-25 08:48:56,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:56,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:56,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:56,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:56,646 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-11-25 08:48:56,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:56,953 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2019-11-25 08:48:56,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:56,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-25 08:48:56,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:56,955 INFO L225 Difference]: With dead ends: 492 [2019-11-25 08:48:56,955 INFO L226 Difference]: Without dead ends: 261 [2019-11-25 08:48:56,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:56,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-25 08:48:56,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2019-11-25 08:48:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:48:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-11-25 08:48:56,964 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-11-25 08:48:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:56,964 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-11-25 08:48:56,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-11-25 08:48:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:48:56,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:56,966 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:56,966 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:56,966 INFO L82 PathProgramCache]: Analyzing trace with hash -251052971, now seen corresponding path program 1 times [2019-11-25 08:48:56,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:56,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103271645] [2019-11-25 08:48:56,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:48:57,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103271645] [2019-11-25 08:48:57,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:57,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:57,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541573469] [2019-11-25 08:48:57,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:57,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:57,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:57,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:57,065 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-11-25 08:48:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:57,391 INFO L93 Difference]: Finished difference Result 519 states and 767 transitions. [2019-11-25 08:48:57,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:57,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-25 08:48:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:57,392 INFO L225 Difference]: With dead ends: 519 [2019-11-25 08:48:57,392 INFO L226 Difference]: Without dead ends: 288 [2019-11-25 08:48:57,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-25 08:48:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-11-25 08:48:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:48:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-11-25 08:48:57,400 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-11-25 08:48:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:57,400 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-11-25 08:48:57,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-11-25 08:48:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:48:57,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:57,401 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:57,402 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:57,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:57,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1937232809, now seen corresponding path program 1 times [2019-11-25 08:48:57,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:57,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164138342] [2019-11-25 08:48:57,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-25 08:48:57,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164138342] [2019-11-25 08:48:57,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:57,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:57,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156191713] [2019-11-25 08:48:57,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:57,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:57,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:57,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:57,465 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-11-25 08:48:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:57,497 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-11-25 08:48:57,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:57,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-25 08:48:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:57,500 INFO L225 Difference]: With dead ends: 710 [2019-11-25 08:48:57,500 INFO L226 Difference]: Without dead ends: 479 [2019-11-25 08:48:57,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-25 08:48:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-11-25 08:48:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-25 08:48:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-11-25 08:48:57,515 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-11-25 08:48:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:57,515 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-11-25 08:48:57,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:57,516 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-11-25 08:48:57,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-25 08:48:57,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:57,517 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:57,518 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:57,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:57,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-11-25 08:48:57,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:57,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842656793] [2019-11-25 08:48:57,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:57,838 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:57,838 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:48:58,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:48:58 BoogieIcfgContainer [2019-11-25 08:48:58,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:48:58,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:48:58,004 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:48:58,004 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:48:58,005 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:40" (3/4) ... [2019-11-25 08:48:58,022 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:48:58,023 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:48:58,029 INFO L168 Benchmark]: Toolchain (without parser) took 19806.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 365.4 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -263.3 MB). Peak memory consumption was 102.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:58,029 INFO L168 Benchmark]: CDTParser took 0.23 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-25 08:48:58,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -206.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:58,030 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:48:58,031 INFO L168 Benchmark]: Boogie Preprocessor took 88.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:58,032 INFO L168 Benchmark]: RCFGBuilder took 1357.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.3 MB). Peak memory consumption was 92.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:58,032 INFO L168 Benchmark]: TraceAbstraction took 17535.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -159.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:58,032 INFO L168 Benchmark]: Witness Printer took 18.82 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:48:58,034 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.23 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 729.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -206.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1357.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.3 MB). Peak memory consumption was 92.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17535.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -159.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Witness Printer took 18.82 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={9:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={9:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={9:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={9:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={9:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={9:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={9:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={9:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND TRUE s->state == 8656 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={9:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={9:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 17.4s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7075 SDtfs, 2083 SDslu, 10603 SDs, 0 SdLazy, 6863 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 76 SyntacticMatches, 29 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 914 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 733119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 1564/1564 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-25 08:49:00,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:49:00,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:49:00,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:49:00,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:49:00,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:49:00,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:49:00,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:49:00,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:49:00,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:49:00,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:49:00,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:49:00,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:49:00,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:49:00,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:49:00,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:49:00,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:49:00,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:49:00,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:49:00,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:49:00,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:49:00,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:49:00,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:49:00,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:49:00,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:49:00,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:49:00,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:49:00,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:49:00,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:49:00,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:49:00,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:49:00,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:49:00,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:49:00,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:49:00,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:49:00,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:49:00,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:49:00,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:49:00,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:49:00,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:49:00,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:49:00,094 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:49:00,115 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:49:00,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:49:00,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:49:00,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:49:00,118 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:49:00,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:49:00,118 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:49:00,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:49:00,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:49:00,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:49:00,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:49:00,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:49:00,121 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:49:00,121 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:49:00,121 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:49:00,121 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:49:00,122 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:49:00,122 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:49:00,122 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:49:00,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:49:00,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:49:00,123 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:49:00,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:49:00,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:49:00,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:49:00,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:49:00,125 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:49:00,125 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:49:00,125 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:49:00,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:49:00,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:49:00,126 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/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 -> a85198d3f93b8c751f2c6e712deab62f97c1022f [2019-11-25 08:49:00,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:49:00,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:49:00,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:49:00,422 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:49:00,423 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:49:00,426 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-25 08:49:00,484 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/data/7c4489769/c7a3c70f765c44208c0bebc1572f29a4/FLAG1db7e0653 [2019-11-25 08:49:01,038 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:49:01,038 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-25 08:49:01,065 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/data/7c4489769/c7a3c70f765c44208c0bebc1572f29a4/FLAG1db7e0653 [2019-11-25 08:49:01,293 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fe0eb1a2-43e8-46f6-9d00-1d3803301970/bin/uautomizer/data/7c4489769/c7a3c70f765c44208c0bebc1572f29a4 [2019-11-25 08:49:01,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:49:01,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:49:01,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:01,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:49:01,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:49:01,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:01" (1/1) ... [2019-11-25 08:49:01,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76884316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:01, skipping insertion in model container [2019-11-25 08:49:01,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:01" (1/1) ... [2019-11-25 08:49:01,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:49:01,373 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:49:01,753 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-25 08:49:01,754 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-25 08:49:01,755 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-25 08:49:01,799 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: Unsupported type(() : VOID) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructBytesizeExpression(TypeSizeAndOffsetComputer.java:121) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:955) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:700) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1300) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3448) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2263) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:573) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-25 08:49:01,809 INFO L168 Benchmark]: Toolchain (without parser) took 507.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:01,810 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:01,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:01,813 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 504.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: Unsupported type(() : VOID): de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...