./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.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_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/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 425afc8b22e60c0a2f2550983f32b043f3f437d4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/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 425afc8b22e60c0a2f2550983f32b043f3f437d4 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:55:54,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:55:54,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:55:54,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:55:54,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:55:54,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:55:54,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:55:54,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:55:54,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:55:54,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:55:54,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:55:54,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:55:54,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:55:54,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:55:54,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:55:54,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:55:54,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:55:54,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:55:54,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:55:54,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:55:54,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:55:54,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:55:54,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:55:54,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:55:54,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:55:54,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:55:54,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:55:54,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:55:54,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:55:54,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:55:54,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:55:54,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:55:54,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:55:54,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:55:54,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:55:54,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:55:54,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:55:54,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:55:54,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:55:54,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:55:54,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:55:54,928 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:55:54,940 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:55:54,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:55:54,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:55:54,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:55:54,942 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:55:54,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:55:54,942 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:55:54,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:55:54,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:55:54,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:55:54,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:55:54,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:55:54,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:55:54,943 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:55:54,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:55:54,944 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:55:54,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:55:54,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:55:54,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:55:54,945 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:55:54,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:55:54,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:55:54,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:55:54,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:55:54,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:55:54,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:55:54,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:55:54,947 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:55:54,947 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_fef28101-8f9e-483b-b87a-92724df52cda/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 -> 425afc8b22e60c0a2f2550983f32b043f3f437d4 [2019-11-25 08:55:55,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:55:55,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:55:55,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:55:55,090 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:55:55,090 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:55:55,091 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-25 08:55:55,138 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/data/f98f22df7/b0ddf6fc9c324a9c8b5878fad94939f3/FLAG116efa03b [2019-11-25 08:55:55,554 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:55:55,554 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-25 08:55:55,564 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/data/f98f22df7/b0ddf6fc9c324a9c8b5878fad94939f3/FLAG116efa03b [2019-11-25 08:55:55,584 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/data/f98f22df7/b0ddf6fc9c324a9c8b5878fad94939f3 [2019-11-25 08:55:55,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:55:55,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:55:55,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:55,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:55:55,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:55:55,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:55" (1/1) ... [2019-11-25 08:55:55,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6400364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:55, skipping insertion in model container [2019-11-25 08:55:55,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:55" (1/1) ... [2019-11-25 08:55:55,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:55:55,632 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:55:55,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:55,909 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:55:55,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:56,001 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:55:56,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:56 WrapperNode [2019-11-25 08:55:56,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:56,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:55:56,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:55:56,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:55:56,015 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:55:56" (1/1) ... [2019-11-25 08:55:56,025 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:55:56" (1/1) ... [2019-11-25 08:55:56,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:55:56,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:55:56,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:55:56,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:55:56,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:56" (1/1) ... [2019-11-25 08:55:56,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:56" (1/1) ... [2019-11-25 08:55:56,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:56" (1/1) ... [2019-11-25 08:55:56,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:56" (1/1) ... [2019-11-25 08:55:56,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:56" (1/1) ... [2019-11-25 08:55:56,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:56" (1/1) ... [2019-11-25 08:55:56,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:56" (1/1) ... [2019-11-25 08:55:56,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:55:56,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:55:56,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:55:56,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:55:56,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/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:55:56,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:55:56,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:55:56,371 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:55:56,884 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-25 08:55:56,884 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-25 08:55:56,885 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:55:56,886 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:55:56,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:56 BoogieIcfgContainer [2019-11-25 08:55:56,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:55:56,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:55:56,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:55:56,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:55:56,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:55:55" (1/3) ... [2019-11-25 08:55:56,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65707cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:55:56, skipping insertion in model container [2019-11-25 08:55:56,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:56" (2/3) ... [2019-11-25 08:55:56,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65707cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:55:56, skipping insertion in model container [2019-11-25 08:55:56,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:56" (3/3) ... [2019-11-25 08:55:56,894 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2019-11-25 08:55:56,901 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:55:56,907 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:55:56,914 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:55:56,936 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:55:56,936 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:55:56,936 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:55:56,936 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:55:56,936 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:55:56,937 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:55:56,937 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:55:56,937 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:55:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-25 08:55:56,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:55:56,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:56,962 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] [2019-11-25 08:55:56,963 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:56,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:56,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-25 08:55:56,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:56,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297168509] [2019-11-25 08:55:56,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,128 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:55:57,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297168509] [2019-11-25 08:55:57,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:57,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:55:57,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857788488] [2019-11-25 08:55:57,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:57,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:57,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:57,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:57,151 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-11-25 08:55:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:57,367 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-11-25 08:55:57,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:57,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-25 08:55:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:57,378 INFO L225 Difference]: With dead ends: 245 [2019-11-25 08:55:57,378 INFO L226 Difference]: Without dead ends: 111 [2019-11-25 08:55:57,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-25 08:55:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-25 08:55:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-25 08:55:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-25 08:55:57,439 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-25 08:55:57,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:57,440 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-25 08:55:57,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-25 08:55:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 08:55:57,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:57,442 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] [2019-11-25 08:55:57,442 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:57,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:57,443 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-25 08:55:57,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:57,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579210004] [2019-11-25 08:55:57,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,540 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:55:57,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579210004] [2019-11-25 08:55:57,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:57,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:57,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216738814] [2019-11-25 08:55:57,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:57,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:57,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:57,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:57,544 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-25 08:55:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:57,732 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-25 08:55:57,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:57,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-25 08:55:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:57,735 INFO L225 Difference]: With dead ends: 232 [2019-11-25 08:55:57,735 INFO L226 Difference]: Without dead ends: 130 [2019-11-25 08:55:57,736 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:55:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-25 08:55:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-25 08:55:57,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-25 08:55:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-25 08:55:57,757 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-25 08:55:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:57,757 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-25 08:55:57,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-25 08:55:57,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:55:57,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:57,761 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:55:57,762 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:57,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:57,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-11-25 08:55:57,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:57,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605504879] [2019-11-25 08:55:57,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:55:57,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605504879] [2019-11-25 08:55:57,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:57,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:57,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285489788] [2019-11-25 08:55:57,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:57,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:57,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:57,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:57,886 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-25 08:55:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:58,032 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-11-25 08:55:58,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:58,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-25 08:55:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:58,034 INFO L225 Difference]: With dead ends: 264 [2019-11-25 08:55:58,034 INFO L226 Difference]: Without dead ends: 147 [2019-11-25 08:55:58,035 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:55:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-25 08:55:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-11-25 08:55:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-25 08:55:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-25 08:55:58,047 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-25 08:55:58,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:58,047 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-25 08:55:58,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-25 08:55:58,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:55:58,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:58,050 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-11-25 08:55:58,050 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:58,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:58,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-11-25 08:55:58,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:58,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847958462] [2019-11-25 08:55:58,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:55:58,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847958462] [2019-11-25 08:55:58,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:58,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:58,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842089023] [2019-11-25 08:55:58,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:58,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:58,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:58,149 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-25 08:55:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:58,175 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-11-25 08:55:58,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:58,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-25 08:55:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:58,178 INFO L225 Difference]: With dead ends: 298 [2019-11-25 08:55:58,178 INFO L226 Difference]: Without dead ends: 164 [2019-11-25 08:55:58,179 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:55:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-25 08:55:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-25 08:55:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-25 08:55:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-11-25 08:55:58,201 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-11-25 08:55:58,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:58,201 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-11-25 08:55:58,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-11-25 08:55:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:55:58,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:58,204 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-11-25 08:55:58,204 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:58,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:58,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-11-25 08:55:58,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:58,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354299621] [2019-11-25 08:55:58,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-25 08:55:58,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354299621] [2019-11-25 08:55:58,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:58,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:58,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495557455] [2019-11-25 08:55:58,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:58,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:58,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:58,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:58,319 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 3 states. [2019-11-25 08:55:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:58,539 INFO L93 Difference]: Finished difference Result 369 states and 549 transitions. [2019-11-25 08:55:58,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:58,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-25 08:55:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:58,542 INFO L225 Difference]: With dead ends: 369 [2019-11-25 08:55:58,542 INFO L226 Difference]: Without dead ends: 213 [2019-11-25 08:55:58,543 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:55:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-25 08:55:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-11-25 08:55:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-25 08:55:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2019-11-25 08:55:58,560 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 66 [2019-11-25 08:55:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:58,561 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2019-11-25 08:55:58,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:58,561 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2019-11-25 08:55:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:55:58,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:58,563 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-11-25 08:55:58,563 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:58,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:58,563 INFO L82 PathProgramCache]: Analyzing trace with hash 507084268, now seen corresponding path program 1 times [2019-11-25 08:55:58,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:58,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158537475] [2019-11-25 08:55:58,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-25 08:55:58,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158537475] [2019-11-25 08:55:58,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:58,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:58,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449078529] [2019-11-25 08:55:58,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:58,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:58,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:58,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:58,615 INFO L87 Difference]: Start difference. First operand 205 states and 287 transitions. Second operand 3 states. [2019-11-25 08:55:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:58,755 INFO L93 Difference]: Finished difference Result 424 states and 601 transitions. [2019-11-25 08:55:58,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:58,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-25 08:55:58,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:58,758 INFO L225 Difference]: With dead ends: 424 [2019-11-25 08:55:58,758 INFO L226 Difference]: Without dead ends: 228 [2019-11-25 08:55:58,759 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:55:58,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-25 08:55:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2019-11-25 08:55:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-25 08:55:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 311 transitions. [2019-11-25 08:55:58,786 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 311 transitions. Word has length 66 [2019-11-25 08:55:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:58,786 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 311 transitions. [2019-11-25 08:55:58,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 311 transitions. [2019-11-25 08:55:58,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-25 08:55:58,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:58,788 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-25 08:55:58,788 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:58,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:58,789 INFO L82 PathProgramCache]: Analyzing trace with hash -374488382, now seen corresponding path program 1 times [2019-11-25 08:55:58,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:58,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40692321] [2019-11-25 08:55:58,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-25 08:55:58,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40692321] [2019-11-25 08:55:58,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:58,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:58,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124897256] [2019-11-25 08:55:58,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:58,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:58,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:58,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:58,858 INFO L87 Difference]: Start difference. First operand 224 states and 311 transitions. Second operand 3 states. [2019-11-25 08:55:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:58,999 INFO L93 Difference]: Finished difference Result 463 states and 651 transitions. [2019-11-25 08:55:58,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:58,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-25 08:55:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:59,001 INFO L225 Difference]: With dead ends: 463 [2019-11-25 08:55:59,001 INFO L226 Difference]: Without dead ends: 248 [2019-11-25 08:55:59,002 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:55:59,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-25 08:55:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2019-11-25 08:55:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-25 08:55:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-11-25 08:55:59,012 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 82 [2019-11-25 08:55:59,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:59,013 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-11-25 08:55:59,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-11-25 08:55:59,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:55:59,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:59,016 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-25 08:55:59,017 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:59,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:59,017 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-11-25 08:55:59,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:59,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410046688] [2019-11-25 08:55:59,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-25 08:55:59,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410046688] [2019-11-25 08:55:59,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:59,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:59,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121155170] [2019-11-25 08:55:59,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:59,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:59,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:59,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:59,079 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 3 states. [2019-11-25 08:55:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:59,118 INFO L93 Difference]: Finished difference Result 694 states and 957 transitions. [2019-11-25 08:55:59,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:59,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-25 08:55:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:59,123 INFO L225 Difference]: With dead ends: 694 [2019-11-25 08:55:59,123 INFO L226 Difference]: Without dead ends: 458 [2019-11-25 08:55:59,124 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:55:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-11-25 08:55:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-11-25 08:55:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-25 08:55:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 630 transitions. [2019-11-25 08:55:59,145 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 630 transitions. Word has length 102 [2019-11-25 08:55:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:59,145 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 630 transitions. [2019-11-25 08:55:59,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 630 transitions. [2019-11-25 08:55:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-25 08:55:59,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:59,147 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-25 08:55:59,147 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:59,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-11-25 08:55:59,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:59,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6650189] [2019-11-25 08:55:59,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-25 08:55:59,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6650189] [2019-11-25 08:55:59,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:59,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:59,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031211337] [2019-11-25 08:55:59,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:59,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:59,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:59,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:59,209 INFO L87 Difference]: Start difference. First operand 458 states and 630 transitions. Second operand 3 states. [2019-11-25 08:55:59,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:59,254 INFO L93 Difference]: Finished difference Result 673 states and 927 transitions. [2019-11-25 08:55:59,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:59,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-25 08:55:59,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:59,258 INFO L225 Difference]: With dead ends: 673 [2019-11-25 08:55:59,259 INFO L226 Difference]: Without dead ends: 671 [2019-11-25 08:55:59,259 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:55:59,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-25 08:55:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-11-25 08:55:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-11-25 08:55:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-11-25 08:55:59,276 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 104 [2019-11-25 08:55:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:59,277 INFO L462 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-11-25 08:55:59,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-11-25 08:55:59,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-25 08:55:59,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:59,280 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 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:55:59,280 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:59,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:59,281 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-11-25 08:55:59,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:59,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576310410] [2019-11-25 08:55:59,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-25 08:55:59,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576310410] [2019-11-25 08:55:59,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:59,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:59,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012972362] [2019-11-25 08:55:59,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:59,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:59,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:59,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:59,338 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-11-25 08:55:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:59,532 INFO L93 Difference]: Finished difference Result 1483 states and 2101 transitions. [2019-11-25 08:55:59,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:59,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-25 08:55:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:59,538 INFO L225 Difference]: With dead ends: 1483 [2019-11-25 08:55:59,538 INFO L226 Difference]: Without dead ends: 818 [2019-11-25 08:55:59,539 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:55:59,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-11-25 08:55:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 788. [2019-11-25 08:55:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-11-25 08:55:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1114 transitions. [2019-11-25 08:55:59,561 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1114 transitions. Word has length 172 [2019-11-25 08:55:59,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:59,561 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1114 transitions. [2019-11-25 08:55:59,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1114 transitions. [2019-11-25 08:55:59,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-25 08:55:59,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:59,565 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:55:59,565 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:59,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:59,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1597857147, now seen corresponding path program 2 times [2019-11-25 08:55:59,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:59,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980306720] [2019-11-25 08:55:59,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-25 08:55:59,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980306720] [2019-11-25 08:55:59,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:59,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:59,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570451297] [2019-11-25 08:55:59,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:59,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:59,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:59,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:59,623 INFO L87 Difference]: Start difference. First operand 788 states and 1114 transitions. Second operand 3 states. [2019-11-25 08:55:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:59,801 INFO L93 Difference]: Finished difference Result 1845 states and 2682 transitions. [2019-11-25 08:55:59,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:59,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-25 08:55:59,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:59,807 INFO L225 Difference]: With dead ends: 1845 [2019-11-25 08:55:59,808 INFO L226 Difference]: Without dead ends: 1015 [2019-11-25 08:55:59,809 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:55:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-11-25 08:55:59,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 977. [2019-11-25 08:55:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-25 08:55:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1366 transitions. [2019-11-25 08:55:59,838 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1366 transitions. Word has length 184 [2019-11-25 08:55:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:59,838 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1366 transitions. [2019-11-25 08:55:59,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:59,839 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1366 transitions. [2019-11-25 08:55:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-25 08:55:59,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:59,842 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2019-11-25 08:55:59,842 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:59,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:59,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-11-25 08:55:59,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:59,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229202725] [2019-11-25 08:55:59,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-25 08:55:59,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229202725] [2019-11-25 08:55:59,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:59,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:59,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268528255] [2019-11-25 08:55:59,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:59,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:59,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:59,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:59,978 INFO L87 Difference]: Start difference. First operand 977 states and 1366 transitions. Second operand 3 states. [2019-11-25 08:56:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:00,010 INFO L93 Difference]: Finished difference Result 2279 states and 3183 transitions. [2019-11-25 08:56:00,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:00,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-25 08:56:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:00,019 INFO L225 Difference]: With dead ends: 2279 [2019-11-25 08:56:00,019 INFO L226 Difference]: Without dead ends: 1311 [2019-11-25 08:56:00,020 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:56:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-11-25 08:56:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-11-25 08:56:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-11-25 08:56:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1827 transitions. [2019-11-25 08:56:00,060 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1827 transitions. Word has length 193 [2019-11-25 08:56:00,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:00,061 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 1827 transitions. [2019-11-25 08:56:00,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1827 transitions. [2019-11-25 08:56:00,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-25 08:56:00,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:00,065 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:00,065 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:00,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:00,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1661550404, now seen corresponding path program 1 times [2019-11-25 08:56:00,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:00,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102403845] [2019-11-25 08:56:00,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-25 08:56:00,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102403845] [2019-11-25 08:56:00,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:00,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:00,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866481534] [2019-11-25 08:56:00,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:00,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:00,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:00,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:00,185 INFO L87 Difference]: Start difference. First operand 1311 states and 1827 transitions. Second operand 3 states. [2019-11-25 08:56:00,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:00,243 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2019-11-25 08:56:00,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:00,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-25 08:56:00,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:00,256 INFO L225 Difference]: With dead ends: 3667 [2019-11-25 08:56:00,256 INFO L226 Difference]: Without dead ends: 2365 [2019-11-25 08:56:00,261 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:56:00,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2019-11-25 08:56:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2019-11-25 08:56:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-11-25 08:56:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3324 transitions. [2019-11-25 08:56:00,339 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3324 transitions. Word has length 195 [2019-11-25 08:56:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:00,339 INFO L462 AbstractCegarLoop]: Abstraction has 2363 states and 3324 transitions. [2019-11-25 08:56:00,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3324 transitions. [2019-11-25 08:56:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-25 08:56:00,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:00,345 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:00,345 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:00,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:00,345 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-11-25 08:56:00,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:00,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639076364] [2019-11-25 08:56:00,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:00,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:00,550 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:56:00,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:56:00 BoogieIcfgContainer [2019-11-25 08:56:00,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:56:00,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:56:00,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:56:00,667 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:56:00,667 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:56" (3/4) ... [2019-11-25 08:56:00,671 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:56:00,671 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:56:00,673 INFO L168 Benchmark]: Toolchain (without parser) took 5084.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 950.1 MB in the beginning and 959.6 MB in the end (delta: -9.5 MB). Peak memory consumption was 214.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:00,673 INFO L168 Benchmark]: CDTParser took 0.22 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:56:00,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -222.7 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:00,674 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.66 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:56:00,675 INFO L168 Benchmark]: Boogie Preprocessor took 76.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:00,678 INFO L168 Benchmark]: RCFGBuilder took 736.41 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: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:00,679 INFO L168 Benchmark]: TraceAbstraction took 3778.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 959.6 MB in the end (delta: 157.3 MB). Peak memory consumption was 203.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:00,679 INFO L168 Benchmark]: Witness Printer took 4.15 ms. Allocated memory is still 1.3 GB. Free memory is still 959.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:00,685 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.22 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 413.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -222.7 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.66 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 76.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 736.41 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: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3778.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 959.6 MB in the end (delta: 157.3 MB). Peak memory consumption was 203.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.15 ms. Allocated memory is still 1.3 GB. Free memory is still 959.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 607]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseXor at line 355. Possible FailurePath: [L616] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y = __VERIFIER_nondet_int(); [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND TRUE blastFlag == 3 [L323] blastFlag = 4 [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND FALSE !(blastFlag == 5) [L350] COND FALSE !(ret <= 0) [L355] s__state = ag_X ^ ag_Y [L356] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND FALSE !(blastFlag == 3) [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND TRUE blastFlag == 5 [L607] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.7s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2411 SDtfs, 803 SDslu, 1336 SDs, 0 SdLazy, 884 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2363occurred in iteration=13, 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, 13 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1532 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1324 ConstructedInterpolants, 0 QuantifiedInterpolants, 420496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2562/2562 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:56:02,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:56:02,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:56:02,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:56:02,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:56:02,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:56:02,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:56:02,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:56:02,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:56:02,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:56:02,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:56:02,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:56:02,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:56:02,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:56:02,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:56:02,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:56:02,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:56:02,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:56:02,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:56:02,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:56:02,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:56:02,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:56:02,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:56:02,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:56:02,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:56:02,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:56:02,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:56:02,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:56:02,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:56:02,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:56:02,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:56:02,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:56:02,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:56:02,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:56:02,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:56:02,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:56:02,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:56:02,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:56:02,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:56:02,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:56:02,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:56:02,667 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:56:02,680 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:56:02,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:56:02,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:56:02,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:56:02,682 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:56:02,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:56:02,683 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:56:02,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:56:02,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:56:02,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:56:02,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:56:02,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:56:02,684 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:56:02,684 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:56:02,684 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:56:02,684 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:56:02,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:56:02,685 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:56:02,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:56:02,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:56:02,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:56:02,686 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:56:02,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:56:02,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:56:02,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:56:02,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:56:02,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:56:02,687 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:56:02,687 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:56:02,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:56:02,688 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:56:02,688 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_fef28101-8f9e-483b-b87a-92724df52cda/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 -> 425afc8b22e60c0a2f2550983f32b043f3f437d4 [2019-11-25 08:56:02,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:56:02,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:56:02,998 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:56:02,999 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:56:03,000 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:56:03,000 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-25 08:56:03,048 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/data/a48e48652/d925b0a8259f49f6a0abfa078babf74b/FLAG21079f2bc [2019-11-25 08:56:03,464 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:56:03,465 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-25 08:56:03,482 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/data/a48e48652/d925b0a8259f49f6a0abfa078babf74b/FLAG21079f2bc [2019-11-25 08:56:03,798 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/data/a48e48652/d925b0a8259f49f6a0abfa078babf74b [2019-11-25 08:56:03,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:56:03,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:56:03,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:03,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:56:03,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:56:03,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:03" (1/1) ... [2019-11-25 08:56:03,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e95319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:03, skipping insertion in model container [2019-11-25 08:56:03,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:03" (1/1) ... [2019-11-25 08:56:03,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:56:03,864 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:56:04,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:04,102 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:56:04,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:04,234 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:56:04,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:04 WrapperNode [2019-11-25 08:56:04,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:04,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:04,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:56:04,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:56:04,246 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:56:04" (1/1) ... [2019-11-25 08:56:04,254 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:56:04" (1/1) ... [2019-11-25 08:56:04,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:04,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:56:04,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:56:04,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:56:04,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:04" (1/1) ... [2019-11-25 08:56:04,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:04" (1/1) ... [2019-11-25 08:56:04,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:04" (1/1) ... [2019-11-25 08:56:04,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:04" (1/1) ... [2019-11-25 08:56:04,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:04" (1/1) ... [2019-11-25 08:56:04,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:04" (1/1) ... [2019-11-25 08:56:04,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:04" (1/1) ... [2019-11-25 08:56:04,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:56:04,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:56:04,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:56:04,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:56:04,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/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:56:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:56:04,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:56:04,480 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:56:05,040 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-25 08:56:05,041 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-25 08:56:05,042 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:56:05,042 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:56:05,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:05 BoogieIcfgContainer [2019-11-25 08:56:05,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:56:05,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:56:05,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:56:05,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:56:05,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:56:03" (1/3) ... [2019-11-25 08:56:05,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42108a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:05, skipping insertion in model container [2019-11-25 08:56:05,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:04" (2/3) ... [2019-11-25 08:56:05,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42108a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:05, skipping insertion in model container [2019-11-25 08:56:05,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:05" (3/3) ... [2019-11-25 08:56:05,051 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2019-11-25 08:56:05,058 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:56:05,063 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:56:05,071 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:56:05,098 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:56:05,098 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:56:05,098 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:56:05,098 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:56:05,099 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:56:05,099 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:56:05,099 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:56:05,099 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:56:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-25 08:56:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:56:05,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:05,119 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] [2019-11-25 08:56:05,119 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:05,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:05,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-25 08:56:05,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:05,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [340754027] [2019-11-25 08:56:05,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:05,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:05,278 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:56:05,278 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:05,291 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:56:05,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [340754027] [2019-11-25 08:56:05,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:05,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 08:56:05,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069383695] [2019-11-25 08:56:05,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:05,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:05,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:05,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:05,321 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-11-25 08:56:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:05,561 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-11-25 08:56:05,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:05,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-25 08:56:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:05,575 INFO L225 Difference]: With dead ends: 245 [2019-11-25 08:56:05,575 INFO L226 Difference]: Without dead ends: 111 [2019-11-25 08:56:05,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:05,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-25 08:56:05,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-25 08:56:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-25 08:56:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-25 08:56:05,616 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-25 08:56:05,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:05,616 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-25 08:56:05,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-25 08:56:05,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 08:56:05,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:05,618 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] [2019-11-25 08:56:05,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:05,819 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:05,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:05,820 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-25 08:56:05,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:05,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1833301303] [2019-11-25 08:56:05,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:05,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:05,921 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:56:05,922 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:05,927 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:56:05,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1833301303] [2019-11-25 08:56:05,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:05,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-25 08:56:05,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498412165] [2019-11-25 08:56:05,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:05,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:05,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:05,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:05,931 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-25 08:56:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:06,109 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-25 08:56:06,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:06,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-25 08:56:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:06,112 INFO L225 Difference]: With dead ends: 232 [2019-11-25 08:56:06,112 INFO L226 Difference]: Without dead ends: 130 [2019-11-25 08:56:06,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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:56:06,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-25 08:56:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-25 08:56:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-25 08:56:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-25 08:56:06,125 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-25 08:56:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:06,126 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-25 08:56:06,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-25 08:56:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:56:06,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:06,129 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:56:06,330 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:06,330 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:06,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:06,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-11-25 08:56:06,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:06,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2068367217] [2019-11-25 08:56:06,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:06,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:06,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:56:06,453 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:56:06,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2068367217] [2019-11-25 08:56:06,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:06,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-25 08:56:06,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522047249] [2019-11-25 08:56:06,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:06,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:06,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:06,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:06,475 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-25 08:56:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:06,658 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-11-25 08:56:06,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:06,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-25 08:56:06,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:06,660 INFO L225 Difference]: With dead ends: 264 [2019-11-25 08:56:06,661 INFO L226 Difference]: Without dead ends: 147 [2019-11-25 08:56:06,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 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:56:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-25 08:56:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-11-25 08:56:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-25 08:56:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-25 08:56:06,683 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-25 08:56:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:06,683 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-25 08:56:06,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-25 08:56:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:56:06,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:06,693 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-11-25 08:56:06,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:06,895 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:06,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:06,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-11-25 08:56:06,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:06,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2021173203] [2019-11-25 08:56:06,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:06,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:07,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:56:07,020 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:56:07,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2021173203] [2019-11-25 08:56:07,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:07,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-25 08:56:07,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659123911] [2019-11-25 08:56:07,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:07,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:07,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:07,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:07,033 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-25 08:56:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:07,060 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-11-25 08:56:07,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:07,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-25 08:56:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:07,063 INFO L225 Difference]: With dead ends: 298 [2019-11-25 08:56:07,063 INFO L226 Difference]: Without dead ends: 164 [2019-11-25 08:56:07,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 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:56:07,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-25 08:56:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-25 08:56:07,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-25 08:56:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-11-25 08:56:07,075 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-11-25 08:56:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:07,076 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-11-25 08:56:07,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-11-25 08:56:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:56:07,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:07,078 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-11-25 08:56:07,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:07,288 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:07,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:07,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-11-25 08:56:07,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:07,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [484646438] [2019-11-25 08:56:07,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:07,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:07,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-25 08:56:07,401 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-25 08:56:07,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [484646438] [2019-11-25 08:56:07,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:07,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-25 08:56:07,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602870550] [2019-11-25 08:56:07,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:07,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:07,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:07,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:07,418 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 4 states. [2019-11-25 08:56:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:07,487 INFO L93 Difference]: Finished difference Result 581 states and 851 transitions. [2019-11-25 08:56:07,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:56:07,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-25 08:56:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:07,495 INFO L225 Difference]: With dead ends: 581 [2019-11-25 08:56:07,495 INFO L226 Difference]: Without dead ends: 426 [2019-11-25 08:56:07,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-11-25 08:56:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2019-11-25 08:56:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-11-25 08:56:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 620 transitions. [2019-11-25 08:56:07,535 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 620 transitions. Word has length 66 [2019-11-25 08:56:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:07,538 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 620 transitions. [2019-11-25 08:56:07,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 620 transitions. [2019-11-25 08:56:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:56:07,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:07,542 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-11-25 08:56:07,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:07,746 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:07,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:07,747 INFO L82 PathProgramCache]: Analyzing trace with hash -942138300, now seen corresponding path program 1 times [2019-11-25 08:56:07,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:07,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2060577869] [2019-11-25 08:56:07,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:07,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:07,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-25 08:56:07,859 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-25 08:56:07,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2060577869] [2019-11-25 08:56:07,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:07,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 08:56:07,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56643523] [2019-11-25 08:56:07,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:07,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:07,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:07,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:07,872 INFO L87 Difference]: Start difference. First operand 426 states and 620 transitions. Second operand 3 states. [2019-11-25 08:56:07,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:07,909 INFO L93 Difference]: Finished difference Result 869 states and 1261 transitions. [2019-11-25 08:56:07,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:07,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-25 08:56:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:07,912 INFO L225 Difference]: With dead ends: 869 [2019-11-25 08:56:07,913 INFO L226 Difference]: Without dead ends: 452 [2019-11-25 08:56:07,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 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:56:07,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-25 08:56:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2019-11-25 08:56:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-25 08:56:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 653 transitions. [2019-11-25 08:56:07,954 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 653 transitions. Word has length 67 [2019-11-25 08:56:07,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:07,954 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 653 transitions. [2019-11-25 08:56:07,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:07,954 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 653 transitions. [2019-11-25 08:56:07,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-25 08:56:07,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:07,956 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:08,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:08,156 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2029292557, now seen corresponding path program 1 times [2019-11-25 08:56:08,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:08,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [387467288] [2019-11-25 08:56:08,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:08,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:08,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-25 08:56:08,283 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-25 08:56:08,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [387467288] [2019-11-25 08:56:08,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:08,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-25 08:56:08,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917168162] [2019-11-25 08:56:08,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:08,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:08,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:08,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:08,303 INFO L87 Difference]: Start difference. First operand 452 states and 653 transitions. Second operand 4 states. [2019-11-25 08:56:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:08,580 INFO L93 Difference]: Finished difference Result 1066 states and 1615 transitions. [2019-11-25 08:56:08,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:56:08,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-25 08:56:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:08,586 INFO L225 Difference]: With dead ends: 1066 [2019-11-25 08:56:08,586 INFO L226 Difference]: Without dead ends: 649 [2019-11-25 08:56:08,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-25 08:56:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 629. [2019-11-25 08:56:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-11-25 08:56:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 887 transitions. [2019-11-25 08:56:08,615 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 887 transitions. Word has length 116 [2019-11-25 08:56:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:08,616 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 887 transitions. [2019-11-25 08:56:08,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 887 transitions. [2019-11-25 08:56:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-25 08:56:08,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:08,619 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:08,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:08,821 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:08,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:08,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1450806153, now seen corresponding path program 1 times [2019-11-25 08:56:08,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:08,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2092357897] [2019-11-25 08:56:08,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:08,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:08,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-25 08:56:08,928 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-25 08:56:08,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2092357897] [2019-11-25 08:56:08,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:08,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-25 08:56:08,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247852969] [2019-11-25 08:56:08,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:08,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:08,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:08,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:08,942 INFO L87 Difference]: Start difference. First operand 629 states and 887 transitions. Second operand 3 states. [2019-11-25 08:56:09,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:09,096 INFO L93 Difference]: Finished difference Result 1291 states and 1846 transitions. [2019-11-25 08:56:09,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:09,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-25 08:56:09,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:09,101 INFO L225 Difference]: With dead ends: 1291 [2019-11-25 08:56:09,101 INFO L226 Difference]: Without dead ends: 697 [2019-11-25 08:56:09,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 229 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:56:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-11-25 08:56:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 686. [2019-11-25 08:56:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-11-25 08:56:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 959 transitions. [2019-11-25 08:56:09,122 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 959 transitions. Word has length 116 [2019-11-25 08:56:09,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:09,122 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 959 transitions. [2019-11-25 08:56:09,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 959 transitions. [2019-11-25 08:56:09,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-25 08:56:09,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:09,125 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 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] [2019-11-25 08:56:09,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:09,327 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:09,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:09,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1686782797, now seen corresponding path program 1 times [2019-11-25 08:56:09,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:09,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1360463297] [2019-11-25 08:56:09,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:09,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:09,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-25 08:56:09,453 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-25 08:56:09,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1360463297] [2019-11-25 08:56:09,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:09,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-25 08:56:09,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242378110] [2019-11-25 08:56:09,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:09,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:09,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:09,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:09,480 INFO L87 Difference]: Start difference. First operand 686 states and 959 transitions. Second operand 3 states. [2019-11-25 08:56:09,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:09,518 INFO L93 Difference]: Finished difference Result 1565 states and 2188 transitions. [2019-11-25 08:56:09,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:09,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-25 08:56:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:09,525 INFO L225 Difference]: With dead ends: 1565 [2019-11-25 08:56:09,525 INFO L226 Difference]: Without dead ends: 914 [2019-11-25 08:56:09,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 261 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:56:09,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-11-25 08:56:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2019-11-25 08:56:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-11-25 08:56:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1272 transitions. [2019-11-25 08:56:09,552 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1272 transitions. Word has length 132 [2019-11-25 08:56:09,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:09,553 INFO L462 AbstractCegarLoop]: Abstraction has 914 states and 1272 transitions. [2019-11-25 08:56:09,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1272 transitions. [2019-11-25 08:56:09,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-25 08:56:09,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:09,556 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 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] [2019-11-25 08:56:09,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:09,759 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:09,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1283173259, now seen corresponding path program 1 times [2019-11-25 08:56:09,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:09,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [555710728] [2019-11-25 08:56:09,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:09,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:09,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-11-25 08:56:09,895 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-11-25 08:56:09,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [555710728] [2019-11-25 08:56:09,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:09,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-25 08:56:09,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692207871] [2019-11-25 08:56:09,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:09,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:09,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:09,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:09,921 INFO L87 Difference]: Start difference. First operand 914 states and 1272 transitions. Second operand 3 states. [2019-11-25 08:56:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:10,101 INFO L93 Difference]: Finished difference Result 1847 states and 2596 transitions. [2019-11-25 08:56:10,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:10,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-25 08:56:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:10,107 INFO L225 Difference]: With dead ends: 1847 [2019-11-25 08:56:10,108 INFO L226 Difference]: Without dead ends: 989 [2019-11-25 08:56:10,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 265 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:56:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-11-25 08:56:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 977. [2019-11-25 08:56:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-25 08:56:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1350 transitions. [2019-11-25 08:56:10,144 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1350 transitions. Word has length 134 [2019-11-25 08:56:10,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:10,145 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1350 transitions. [2019-11-25 08:56:10,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1350 transitions. [2019-11-25 08:56:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-25 08:56:10,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:10,149 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:10,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:10,352 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:10,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:10,352 INFO L82 PathProgramCache]: Analyzing trace with hash 204159321, now seen corresponding path program 1 times [2019-11-25 08:56:10,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:10,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1602296916] [2019-11-25 08:56:10,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:10,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:10,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:10,542 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-25 08:56:10,542 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-25 08:56:10,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1602296916] [2019-11-25 08:56:10,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:10,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-25 08:56:10,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973977442] [2019-11-25 08:56:10,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:10,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:10,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:10,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:10,579 INFO L87 Difference]: Start difference. First operand 977 states and 1350 transitions. Second operand 3 states. [2019-11-25 08:56:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:10,636 INFO L93 Difference]: Finished difference Result 2432 states and 3404 transitions. [2019-11-25 08:56:10,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:10,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-25 08:56:10,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:10,646 INFO L225 Difference]: With dead ends: 2432 [2019-11-25 08:56:10,646 INFO L226 Difference]: Without dead ends: 1511 [2019-11-25 08:56:10,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 345 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:56:10,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-11-25 08:56:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2019-11-25 08:56:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2019-11-25 08:56:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2114 transitions. [2019-11-25 08:56:10,700 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2114 transitions. Word has length 174 [2019-11-25 08:56:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:10,701 INFO L462 AbstractCegarLoop]: Abstraction has 1509 states and 2114 transitions. [2019-11-25 08:56:10,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2114 transitions. [2019-11-25 08:56:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-25 08:56:10,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:10,705 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:10,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:10,915 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2009597655, now seen corresponding path program 1 times [2019-11-25 08:56:10,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:10,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1807697724] [2019-11-25 08:56:10,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:11,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:11,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-25 08:56:11,083 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-25 08:56:11,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1807697724] [2019-11-25 08:56:11,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:11,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-25 08:56:11,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888032767] [2019-11-25 08:56:11,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:11,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:11,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:11,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:11,118 INFO L87 Difference]: Start difference. First operand 1509 states and 2114 transitions. Second operand 3 states. [2019-11-25 08:56:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:11,175 INFO L93 Difference]: Finished difference Result 2354 states and 3283 transitions. [2019-11-25 08:56:11,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:11,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-25 08:56:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:11,184 INFO L225 Difference]: With dead ends: 2354 [2019-11-25 08:56:11,184 INFO L226 Difference]: Without dead ends: 1513 [2019-11-25 08:56:11,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 345 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:56:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-11-25 08:56:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1511. [2019-11-25 08:56:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2019-11-25 08:56:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2107 transitions. [2019-11-25 08:56:11,236 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2107 transitions. Word has length 174 [2019-11-25 08:56:11,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:11,237 INFO L462 AbstractCegarLoop]: Abstraction has 1511 states and 2107 transitions. [2019-11-25 08:56:11,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2107 transitions. [2019-11-25 08:56:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-25 08:56:11,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:11,241 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 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] [2019-11-25 08:56:11,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:11,445 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:11,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:11,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1462336803, now seen corresponding path program 1 times [2019-11-25 08:56:11,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:11,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [783434870] [2019-11-25 08:56:11,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:11,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:11,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-25 08:56:11,604 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-25 08:56:11,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [783434870] [2019-11-25 08:56:11,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:11,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-25 08:56:11,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334416520] [2019-11-25 08:56:11,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:11,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:11,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:11,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:11,632 INFO L87 Difference]: Start difference. First operand 1511 states and 2107 transitions. Second operand 4 states. [2019-11-25 08:56:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:11,885 INFO L93 Difference]: Finished difference Result 3056 states and 4299 transitions. [2019-11-25 08:56:11,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:56:11,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-25 08:56:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:11,894 INFO L225 Difference]: With dead ends: 3056 [2019-11-25 08:56:11,894 INFO L226 Difference]: Without dead ends: 1603 [2019-11-25 08:56:11,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:11,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-11-25 08:56:11,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1557. [2019-11-25 08:56:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-11-25 08:56:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2119 transitions. [2019-11-25 08:56:11,953 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2119 transitions. Word has length 174 [2019-11-25 08:56:11,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:11,953 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 2119 transitions. [2019-11-25 08:56:11,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2119 transitions. [2019-11-25 08:56:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-25 08:56:11,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:11,957 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:12,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:12,160 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:12,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:12,160 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-11-25 08:56:12,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:12,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [487916259] [2019-11-25 08:56:12,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:12,860 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-25 08:56:12,860 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:56:13,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:13,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:56:13 BoogieIcfgContainer [2019-11-25 08:56:13,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:56:13,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:56:13,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:56:13,187 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:56:13,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:05" (3/4) ... [2019-11-25 08:56:13,190 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:56:13,316 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fef28101-8f9e-483b-b87a-92724df52cda/bin/uautomizer/witness.graphml [2019-11-25 08:56:13,317 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:56:13,318 INFO L168 Benchmark]: Toolchain (without parser) took 9515.53 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.3 MB). Free memory was 960.4 MB in the beginning and 1.3 GB in the end (delta: -319.6 MB). Peak memory consumption was 451.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:13,319 INFO L168 Benchmark]: CDTParser took 0.24 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:56:13,319 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:13,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:13,320 INFO L168 Benchmark]: Boogie Preprocessor took 39.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:13,320 INFO L168 Benchmark]: RCFGBuilder took 715.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:13,320 INFO L168 Benchmark]: TraceAbstraction took 8142.47 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.0 GB in the beginning and 806.4 MB in the end (delta: 238.5 MB). Peak memory consumption was 424.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:13,321 INFO L168 Benchmark]: Witness Printer took 130.06 ms. Allocated memory is still 1.3 GB. Free memory was 806.4 MB in the beginning and 1.3 GB in the end (delta: -473.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:13,322 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.24 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 431.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 715.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8142.47 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.0 GB in the beginning and 806.4 MB in the end (delta: 238.5 MB). Peak memory consumption was 424.6 MB. Max. memory is 11.5 GB. * Witness Printer took 130.06 ms. Allocated memory is still 1.3 GB. Free memory was 806.4 MB in the beginning and 1.3 GB in the end (delta: -473.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 607]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L616] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y = __VERIFIER_nondet_int(); [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND TRUE blastFlag == 3 [L323] blastFlag = 4 [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND FALSE !(blastFlag == 5) [L350] COND FALSE !(ret <= 0) [L355] s__state = ag_X ^ ag_Y [L356] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND FALSE !(blastFlag == 3) [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND TRUE blastFlag == 5 [L607] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 8.0s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2513 SDtfs, 1104 SDslu, 1676 SDs, 0 SdLazy, 922 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2626 GetRequests, 2610 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1557occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 101 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1521 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2626 ConstructedInterpolants, 0 QuantifiedInterpolants, 558953 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1994 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 4520/4520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...