./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/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_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/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_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/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_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/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.25-f470102 [2019-12-07 18:10:37,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:10:37,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:10:37,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:10:37,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:10:37,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:10:37,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:10:37,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:10:37,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:10:37,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:10:37,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:10:37,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:10:37,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:10:37,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:10:37,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:10:37,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:10:37,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:10:37,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:10:37,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:10:37,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:10:37,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:10:37,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:10:37,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:10:37,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:10:37,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:10:37,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:10:37,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:10:37,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:10:37,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:10:37,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:10:37,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:10:37,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:10:37,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:10:37,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:10:37,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:10:37,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:10:37,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:10:37,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:10:37,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:10:37,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:10:37,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:10:37,174 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:10:37,186 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:10:37,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:10:37,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:10:37,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:10:37,188 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:10:37,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:10:37,188 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:10:37,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:10:37,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:10:37,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:10:37,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:10:37,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:10:37,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:10:37,189 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:10:37,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:10:37,190 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:10:37,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:10:37,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:10:37,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:10:37,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:10:37,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:10:37,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:10:37,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:10:37,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:10:37,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:10:37,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:10:37,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:10:37,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:10:37,192 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:10:37,192 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_5a38825e-1149-4aed-87c6-0997e2401bbb/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-12-07 18:10:37,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:10:37,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:10:37,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:10:37,320 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:10:37,320 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:10:37,321 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-12-07 18:10:37,357 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/data/862229fa9/a9b49501bb684293bbd996cf1a45bc8c/FLAG6f9482fd1 [2019-12-07 18:10:37,691 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:10:37,692 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-12-07 18:10:37,699 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/data/862229fa9/a9b49501bb684293bbd996cf1a45bc8c/FLAG6f9482fd1 [2019-12-07 18:10:37,708 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/data/862229fa9/a9b49501bb684293bbd996cf1a45bc8c [2019-12-07 18:10:37,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:10:37,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:10:37,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:10:37,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:10:37,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:10:37,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:10:37" (1/1) ... [2019-12-07 18:10:37,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1dd896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:37, skipping insertion in model container [2019-12-07 18:10:37,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:10:37" (1/1) ... [2019-12-07 18:10:37,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:10:37,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:10:37,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:10:37,912 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:10:37,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:10:37,955 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:10:37,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:37 WrapperNode [2019-12-07 18:10:37,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:10:37,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:10:37,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:10:37,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:10:37,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:37" (1/1) ... [2019-12-07 18:10:37,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:37" (1/1) ... [2019-12-07 18:10:37,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:10:37,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:10:37,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:10:37,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:10:37,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:37" (1/1) ... [2019-12-07 18:10:37,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:37" (1/1) ... [2019-12-07 18:10:38,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:37" (1/1) ... [2019-12-07 18:10:38,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:37" (1/1) ... [2019-12-07 18:10:38,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:37" (1/1) ... [2019-12-07 18:10:38,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:37" (1/1) ... [2019-12-07 18:10:38,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:37" (1/1) ... [2019-12-07 18:10:38,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:10:38,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:10:38,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:10:38,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:10:38,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/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-12-07 18:10:38,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:10:38,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:10:38,125 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 18:10:38,381 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 18:10:38,381 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 18:10:38,382 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:10:38,382 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:10:38,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:10:38 BoogieIcfgContainer [2019-12-07 18:10:38,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:10:38,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:10:38,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:10:38,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:10:38,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:10:37" (1/3) ... [2019-12-07 18:10:38,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c87c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:10:38, skipping insertion in model container [2019-12-07 18:10:38,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:37" (2/3) ... [2019-12-07 18:10:38,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c87c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:10:38, skipping insertion in model container [2019-12-07 18:10:38,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:10:38" (3/3) ... [2019-12-07 18:10:38,387 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2019-12-07 18:10:38,393 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:10:38,397 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:10:38,404 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:10:38,420 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:10:38,420 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:10:38,420 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:10:38,420 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:10:38,420 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:10:38,420 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:10:38,421 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:10:38,421 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:10:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-12-07 18:10:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:10:38,437 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:38,438 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-12-07 18:10:38,438 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:38,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:38,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-12-07 18:10:38,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:38,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427306235] [2019-12-07 18:10:38,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:38,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427306235] [2019-12-07 18:10:38,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:38,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:10:38,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050239718] [2019-12-07 18:10:38,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:38,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:38,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:38,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:38,590 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-12-07 18:10:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:38,692 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-12-07 18:10:38,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:38,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 18:10:38,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:38,700 INFO L225 Difference]: With dead ends: 245 [2019-12-07 18:10:38,700 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 18:10:38,704 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-12-07 18:10:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 18:10:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-12-07 18:10:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 18:10:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-12-07 18:10:38,737 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-12-07 18:10:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:38,737 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-12-07 18:10:38,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-12-07 18:10:38,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:10:38,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:38,738 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-12-07 18:10:38,739 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:38,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:38,739 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-12-07 18:10:38,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:38,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94181380] [2019-12-07 18:10:38,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:38,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94181380] [2019-12-07 18:10:38,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:38,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:10:38,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561393331] [2019-12-07 18:10:38,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:38,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:38,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:38,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:38,791 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-12-07 18:10:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:38,875 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-12-07 18:10:38,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:38,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 18:10:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:38,877 INFO L225 Difference]: With dead ends: 232 [2019-12-07 18:10:38,877 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 18:10:38,878 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-12-07 18:10:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 18:10:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-12-07 18:10:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 18:10:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-12-07 18:10:38,886 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-12-07 18:10:38,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:38,886 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-12-07 18:10:38,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-12-07 18:10:38,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:10:38,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:38,887 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-12-07 18:10:38,888 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:38,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:38,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-12-07 18:10:38,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:38,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249507674] [2019-12-07 18:10:38,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:10:38,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249507674] [2019-12-07 18:10:38,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:38,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:10:38,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814331708] [2019-12-07 18:10:38,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:38,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:38,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:38,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:38,932 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-12-07 18:10:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:39,013 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-12-07 18:10:39,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:39,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-07 18:10:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:39,015 INFO L225 Difference]: With dead ends: 264 [2019-12-07 18:10:39,015 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 18:10:39,016 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-12-07 18:10:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 18:10:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-12-07 18:10:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 18:10:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-12-07 18:10:39,023 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-12-07 18:10:39,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:39,023 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-12-07 18:10:39,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-12-07 18:10:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:10:39,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:39,025 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-12-07 18:10:39,025 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:39,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:39,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-12-07 18:10:39,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:39,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971265504] [2019-12-07 18:10:39,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:10:39,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971265504] [2019-12-07 18:10:39,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:39,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:10:39,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916885549] [2019-12-07 18:10:39,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:39,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:39,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:39,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:39,080 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-12-07 18:10:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:39,100 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-12-07 18:10:39,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:39,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 18:10:39,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:39,103 INFO L225 Difference]: With dead ends: 298 [2019-12-07 18:10:39,103 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 18:10:39,104 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-12-07 18:10:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 18:10:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-12-07 18:10:39,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 18:10:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-12-07 18:10:39,113 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-12-07 18:10:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:39,113 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-12-07 18:10:39,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-12-07 18:10:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:10:39,116 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:39,116 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-12-07 18:10:39,116 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:39,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:39,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-12-07 18:10:39,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:39,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984405505] [2019-12-07 18:10:39,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 18:10:39,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984405505] [2019-12-07 18:10:39,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:39,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:10:39,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789946441] [2019-12-07 18:10:39,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:39,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:39,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:39,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:39,171 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 3 states. [2019-12-07 18:10:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:39,294 INFO L93 Difference]: Finished difference Result 369 states and 549 transitions. [2019-12-07 18:10:39,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:39,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 18:10:39,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:39,296 INFO L225 Difference]: With dead ends: 369 [2019-12-07 18:10:39,296 INFO L226 Difference]: Without dead ends: 213 [2019-12-07 18:10:39,296 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-12-07 18:10:39,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-12-07 18:10:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-12-07 18:10:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-12-07 18:10:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2019-12-07 18:10:39,304 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 66 [2019-12-07 18:10:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:39,304 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2019-12-07 18:10:39,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2019-12-07 18:10:39,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:10:39,306 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:39,306 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-12-07 18:10:39,306 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:39,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:39,306 INFO L82 PathProgramCache]: Analyzing trace with hash 507084268, now seen corresponding path program 1 times [2019-12-07 18:10:39,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:39,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624565546] [2019-12-07 18:10:39,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 18:10:39,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624565546] [2019-12-07 18:10:39,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:39,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:10:39,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372685490] [2019-12-07 18:10:39,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:39,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:39,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:39,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:39,351 INFO L87 Difference]: Start difference. First operand 205 states and 287 transitions. Second operand 3 states. [2019-12-07 18:10:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:39,434 INFO L93 Difference]: Finished difference Result 424 states and 601 transitions. [2019-12-07 18:10:39,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:39,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 18:10:39,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:39,435 INFO L225 Difference]: With dead ends: 424 [2019-12-07 18:10:39,435 INFO L226 Difference]: Without dead ends: 228 [2019-12-07 18:10:39,436 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-12-07 18:10:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-12-07 18:10:39,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2019-12-07 18:10:39,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-07 18:10:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 311 transitions. [2019-12-07 18:10:39,442 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 311 transitions. Word has length 66 [2019-12-07 18:10:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:39,442 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 311 transitions. [2019-12-07 18:10:39,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 311 transitions. [2019-12-07 18:10:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 18:10:39,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:39,450 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-12-07 18:10:39,450 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:39,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:39,451 INFO L82 PathProgramCache]: Analyzing trace with hash -374488382, now seen corresponding path program 1 times [2019-12-07 18:10:39,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:39,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499917908] [2019-12-07 18:10:39,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-07 18:10:39,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499917908] [2019-12-07 18:10:39,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:39,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:10:39,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860995928] [2019-12-07 18:10:39,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:39,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:39,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:39,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:39,483 INFO L87 Difference]: Start difference. First operand 224 states and 311 transitions. Second operand 3 states. [2019-12-07 18:10:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:39,555 INFO L93 Difference]: Finished difference Result 463 states and 651 transitions. [2019-12-07 18:10:39,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:39,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-07 18:10:39,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:39,557 INFO L225 Difference]: With dead ends: 463 [2019-12-07 18:10:39,557 INFO L226 Difference]: Without dead ends: 248 [2019-12-07 18:10:39,557 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-12-07 18:10:39,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-07 18:10:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2019-12-07 18:10:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 18:10:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-12-07 18:10:39,562 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 82 [2019-12-07 18:10:39,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:39,563 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-12-07 18:10:39,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-12-07 18:10:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 18:10:39,564 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:39,564 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-12-07 18:10:39,564 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:39,564 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-12-07 18:10:39,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:39,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512355630] [2019-12-07 18:10:39,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 18:10:39,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512355630] [2019-12-07 18:10:39,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:39,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:10:39,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841225974] [2019-12-07 18:10:39,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:39,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:39,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:39,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:39,600 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 3 states. [2019-12-07 18:10:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:39,623 INFO L93 Difference]: Finished difference Result 694 states and 957 transitions. [2019-12-07 18:10:39,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:39,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-12-07 18:10:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:39,626 INFO L225 Difference]: With dead ends: 694 [2019-12-07 18:10:39,626 INFO L226 Difference]: Without dead ends: 458 [2019-12-07 18:10:39,626 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-12-07 18:10:39,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-07 18:10:39,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-12-07 18:10:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-12-07 18:10:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 630 transitions. [2019-12-07 18:10:39,635 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 630 transitions. Word has length 102 [2019-12-07 18:10:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:39,635 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 630 transitions. [2019-12-07 18:10:39,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 630 transitions. [2019-12-07 18:10:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 18:10:39,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:39,637 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-12-07 18:10:39,637 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:39,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:39,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-12-07 18:10:39,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:39,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204170741] [2019-12-07 18:10:39,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-12-07 18:10:39,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204170741] [2019-12-07 18:10:39,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:39,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:10:39,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989874862] [2019-12-07 18:10:39,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:39,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:39,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:39,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:39,666 INFO L87 Difference]: Start difference. First operand 458 states and 630 transitions. Second operand 3 states. [2019-12-07 18:10:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:39,689 INFO L93 Difference]: Finished difference Result 673 states and 927 transitions. [2019-12-07 18:10:39,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:39,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 18:10:39,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:39,692 INFO L225 Difference]: With dead ends: 673 [2019-12-07 18:10:39,692 INFO L226 Difference]: Without dead ends: 671 [2019-12-07 18:10:39,693 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-12-07 18:10:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-12-07 18:10:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-12-07 18:10:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-12-07 18:10:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-12-07 18:10:39,704 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 104 [2019-12-07 18:10:39,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:39,704 INFO L462 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-12-07 18:10:39,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-12-07 18:10:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 18:10:39,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:39,706 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-12-07 18:10:39,706 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:39,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:39,706 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-12-07 18:10:39,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:39,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191068794] [2019-12-07 18:10:39,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-12-07 18:10:39,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191068794] [2019-12-07 18:10:39,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:39,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:10:39,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530943975] [2019-12-07 18:10:39,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:39,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:39,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:39,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:39,744 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-12-07 18:10:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:39,861 INFO L93 Difference]: Finished difference Result 1483 states and 2101 transitions. [2019-12-07 18:10:39,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:39,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-12-07 18:10:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:39,866 INFO L225 Difference]: With dead ends: 1483 [2019-12-07 18:10:39,866 INFO L226 Difference]: Without dead ends: 818 [2019-12-07 18:10:39,868 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-12-07 18:10:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-12-07 18:10:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 788. [2019-12-07 18:10:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-12-07 18:10:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1114 transitions. [2019-12-07 18:10:39,888 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1114 transitions. Word has length 172 [2019-12-07 18:10:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:39,889 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1114 transitions. [2019-12-07 18:10:39,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1114 transitions. [2019-12-07 18:10:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-12-07 18:10:39,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:39,892 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-12-07 18:10:39,892 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:39,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1597857147, now seen corresponding path program 2 times [2019-12-07 18:10:39,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:39,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632804455] [2019-12-07 18:10:39,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-12-07 18:10:39,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632804455] [2019-12-07 18:10:39,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:39,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:10:39,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117055136] [2019-12-07 18:10:39,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:39,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:39,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:39,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:39,938 INFO L87 Difference]: Start difference. First operand 788 states and 1114 transitions. Second operand 3 states. [2019-12-07 18:10:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:40,064 INFO L93 Difference]: Finished difference Result 1845 states and 2682 transitions. [2019-12-07 18:10:40,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:40,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-12-07 18:10:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:40,069 INFO L225 Difference]: With dead ends: 1845 [2019-12-07 18:10:40,069 INFO L226 Difference]: Without dead ends: 1015 [2019-12-07 18:10:40,070 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-12-07 18:10:40,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-12-07 18:10:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 977. [2019-12-07 18:10:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-12-07 18:10:40,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1366 transitions. [2019-12-07 18:10:40,087 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1366 transitions. Word has length 184 [2019-12-07 18:10:40,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:40,088 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1366 transitions. [2019-12-07 18:10:40,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1366 transitions. [2019-12-07 18:10:40,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 18:10:40,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:40,090 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-12-07 18:10:40,090 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:40,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:40,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-12-07 18:10:40,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:40,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028046855] [2019-12-07 18:10:40,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 18:10:40,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028046855] [2019-12-07 18:10:40,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:40,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:10:40,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768382028] [2019-12-07 18:10:40,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:40,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:40,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:40,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:40,171 INFO L87 Difference]: Start difference. First operand 977 states and 1366 transitions. Second operand 3 states. [2019-12-07 18:10:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:40,195 INFO L93 Difference]: Finished difference Result 2279 states and 3183 transitions. [2019-12-07 18:10:40,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:40,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-12-07 18:10:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:40,200 INFO L225 Difference]: With dead ends: 2279 [2019-12-07 18:10:40,200 INFO L226 Difference]: Without dead ends: 1311 [2019-12-07 18:10:40,201 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-12-07 18:10:40,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-12-07 18:10:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-12-07 18:10:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-12-07 18:10:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1827 transitions. [2019-12-07 18:10:40,225 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1827 transitions. Word has length 193 [2019-12-07 18:10:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:40,226 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 1827 transitions. [2019-12-07 18:10:40,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:40,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1827 transitions. [2019-12-07 18:10:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-12-07 18:10:40,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:40,228 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-12-07 18:10:40,228 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:40,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1661550404, now seen corresponding path program 1 times [2019-12-07 18:10:40,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:40,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356455466] [2019-12-07 18:10:40,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 18:10:40,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356455466] [2019-12-07 18:10:40,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:40,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:10:40,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137661597] [2019-12-07 18:10:40,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:40,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:40,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:40,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:40,281 INFO L87 Difference]: Start difference. First operand 1311 states and 1827 transitions. Second operand 3 states. [2019-12-07 18:10:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:40,324 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2019-12-07 18:10:40,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:40,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-12-07 18:10:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:40,338 INFO L225 Difference]: With dead ends: 3667 [2019-12-07 18:10:40,338 INFO L226 Difference]: Without dead ends: 2365 [2019-12-07 18:10:40,340 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-12-07 18:10:40,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2019-12-07 18:10:40,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2019-12-07 18:10:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-12-07 18:10:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3324 transitions. [2019-12-07 18:10:40,387 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3324 transitions. Word has length 195 [2019-12-07 18:10:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:40,388 INFO L462 AbstractCegarLoop]: Abstraction has 2363 states and 3324 transitions. [2019-12-07 18:10:40,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3324 transitions. [2019-12-07 18:10:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-12-07 18:10:40,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:40,391 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-12-07 18:10:40,391 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-12-07 18:10:40,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:40,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302262350] [2019-12-07 18:10:40,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:10:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:10:40,502 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:10:40,502 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:10:40,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:10:40 BoogieIcfgContainer [2019-12-07 18:10:40,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:10:40,559 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:10:40,559 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:10:40,559 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:10:40,559 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:10:38" (3/4) ... [2019-12-07 18:10:40,561 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:10:40,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:10:40,563 INFO L168 Benchmark]: Toolchain (without parser) took 2851.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 940.8 MB in the beginning and 892.3 MB in the end (delta: 48.5 MB). Peak memory consumption was 198.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:10:40,563 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:10:40,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:10:40,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.93 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-12-07 18:10:40,564 INFO L168 Benchmark]: Boogie Preprocessor took 24.11 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:10:40,564 INFO L168 Benchmark]: RCFGBuilder took 367.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:10:40,565 INFO L168 Benchmark]: TraceAbstraction took 2175.08 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.0 GB in the beginning and 892.3 MB in the end (delta: 128.8 MB). Peak memory consumption was 190.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:10:40,565 INFO L168 Benchmark]: Witness Printer took 2.80 ms. Allocated memory is still 1.2 GB. Free memory is still 892.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:10:40,566 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.11 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 367.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2175.08 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.0 GB in the beginning and 892.3 MB in the end (delta: 128.8 MB). Peak memory consumption was 190.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.80 ms. Allocated memory is still 1.2 GB. Free memory is still 892.3 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: 2.0s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2411 SDtfs, 803 SDslu, 1336 SDs, 0 SdLazy, 884 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s 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.25-f470102 [2019-12-07 18:10:41,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:10:41,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:10:41,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:10:41,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:10:41,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:10:41,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:10:41,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:10:41,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:10:41,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:10:41,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:10:41,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:10:41,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:10:41,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:10:41,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:10:41,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:10:41,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:10:41,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:10:41,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:10:41,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:10:41,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:10:41,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:10:41,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:10:41,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:10:41,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:10:41,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:10:41,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:10:41,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:10:41,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:10:41,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:10:41,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:10:41,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:10:41,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:10:41,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:10:41,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:10:41,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:10:41,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:10:41,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:10:41,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:10:41,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:10:41,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:10:41,962 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 18:10:41,972 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:10:41,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:10:41,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:10:41,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:10:41,973 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:10:41,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:10:41,973 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:10:41,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:10:41,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:10:41,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:10:41,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:10:41,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:10:41,974 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 18:10:41,974 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 18:10:41,974 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:10:41,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:10:41,975 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:10:41,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:10:41,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:10:41,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:10:41,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:10:41,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:10:41,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:10:41,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:10:41,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:10:41,976 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:10:41,976 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 18:10:41,976 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 18:10:41,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:10:41,976 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:10:41,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 18:10:41,977 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_5a38825e-1149-4aed-87c6-0997e2401bbb/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-12-07 18:10:42,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:10:42,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:10:42,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:10:42,165 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:10:42,166 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:10:42,166 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-12-07 18:10:42,205 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/data/c6845a361/6b7f58fd59f140368949e4958e315433/FLAGacebe455c [2019-12-07 18:10:42,544 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:10:42,545 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-12-07 18:10:42,552 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/data/c6845a361/6b7f58fd59f140368949e4958e315433/FLAGacebe455c [2019-12-07 18:10:42,561 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/data/c6845a361/6b7f58fd59f140368949e4958e315433 [2019-12-07 18:10:42,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:10:42,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:10:42,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:10:42,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:10:42,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:10:42,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:10:42" (1/1) ... [2019-12-07 18:10:42,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41944eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:42, skipping insertion in model container [2019-12-07 18:10:42,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:10:42" (1/1) ... [2019-12-07 18:10:42,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:10:42,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:10:42,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:10:42,736 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:10:42,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:10:42,810 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:10:42,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:42 WrapperNode [2019-12-07 18:10:42,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:10:42,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:10:42,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:10:42,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:10:42,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:42" (1/1) ... [2019-12-07 18:10:42,824 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:42" (1/1) ... [2019-12-07 18:10:42,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:10:42,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:10:42,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:10:42,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:10:42,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:42" (1/1) ... [2019-12-07 18:10:42,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:42" (1/1) ... [2019-12-07 18:10:42,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:42" (1/1) ... [2019-12-07 18:10:42,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:42" (1/1) ... [2019-12-07 18:10:42,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:42" (1/1) ... [2019-12-07 18:10:42,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:42" (1/1) ... [2019-12-07 18:10:42,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:42" (1/1) ... [2019-12-07 18:10:42,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:10:42,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:10:42,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:10:42,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:10:42,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/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-12-07 18:10:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:10:42,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:10:42,983 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 18:10:43,272 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 18:10:43,272 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 18:10:43,273 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:10:43,273 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:10:43,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:10:43 BoogieIcfgContainer [2019-12-07 18:10:43,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:10:43,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:10:43,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:10:43,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:10:43,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:10:42" (1/3) ... [2019-12-07 18:10:43,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4072a4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:10:43, skipping insertion in model container [2019-12-07 18:10:43,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:42" (2/3) ... [2019-12-07 18:10:43,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4072a4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:10:43, skipping insertion in model container [2019-12-07 18:10:43,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:10:43" (3/3) ... [2019-12-07 18:10:43,281 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2019-12-07 18:10:43,290 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:10:43,296 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:10:43,306 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:10:43,329 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:10:43,329 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:10:43,329 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:10:43,329 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:10:43,329 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:10:43,330 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:10:43,330 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:10:43,330 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:10:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-12-07 18:10:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:10:43,351 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:43,352 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-12-07 18:10:43,352 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:43,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:43,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-12-07 18:10:43,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:10:43,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924707452] [2019-12-07 18:10:43,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 18:10:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:43,417 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:10:43,421 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:43,448 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:10:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:43,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924707452] [2019-12-07 18:10:43,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:43,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 18:10:43,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266925973] [2019-12-07 18:10:43,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:43,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:10:43,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:43,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:43,470 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-12-07 18:10:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:43,589 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-12-07 18:10:43,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:43,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 18:10:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:43,599 INFO L225 Difference]: With dead ends: 245 [2019-12-07 18:10:43,599 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 18:10:43,602 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-12-07 18:10:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 18:10:43,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-12-07 18:10:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 18:10:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-12-07 18:10:43,633 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-12-07 18:10:43,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:43,633 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-12-07 18:10:43,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:43,634 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-12-07 18:10:43,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:10:43,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:43,635 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-12-07 18:10:43,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 18:10:43,836 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:43,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:43,837 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-12-07 18:10:43,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:10:43,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585929610] [2019-12-07 18:10:43,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 18:10:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:43,923 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:10:43,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:43,933 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:10:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:43,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585929610] [2019-12-07 18:10:43,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:43,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:10:43,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63901628] [2019-12-07 18:10:43,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:43,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:10:43,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:43,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:43,939 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-12-07 18:10:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:44,047 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-12-07 18:10:44,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:44,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 18:10:44,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:44,049 INFO L225 Difference]: With dead ends: 232 [2019-12-07 18:10:44,049 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 18:10:44,050 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-12-07 18:10:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 18:10:44,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-12-07 18:10:44,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 18:10:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-12-07 18:10:44,058 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-12-07 18:10:44,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:44,058 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-12-07 18:10:44,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-12-07 18:10:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:10:44,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:44,060 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-12-07 18:10:44,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 18:10:44,261 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-12-07 18:10:44,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:10:44,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546653261] [2019-12-07 18:10:44,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 18:10:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:44,308 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:10:44,310 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:10:44,318 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:10:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:10:44,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546653261] [2019-12-07 18:10:44,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:44,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:10:44,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474674858] [2019-12-07 18:10:44,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:44,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:10:44,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:44,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:44,327 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-12-07 18:10:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:44,442 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-12-07 18:10:44,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:44,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-07 18:10:44,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:44,444 INFO L225 Difference]: With dead ends: 264 [2019-12-07 18:10:44,444 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 18:10:44,445 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-12-07 18:10:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 18:10:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-12-07 18:10:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 18:10:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-12-07 18:10:44,456 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-12-07 18:10:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:44,456 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-12-07 18:10:44,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-12-07 18:10:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:10:44,459 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:44,459 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-12-07 18:10:44,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 18:10:44,660 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:44,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-12-07 18:10:44,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:10:44,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223665881] [2019-12-07 18:10:44,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 18:10:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:44,744 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:10:44,747 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:10:44,756 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:10:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:10:44,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223665881] [2019-12-07 18:10:44,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:44,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:10:44,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557718776] [2019-12-07 18:10:44,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:44,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:10:44,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:44,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:44,765 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-12-07 18:10:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:44,785 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-12-07 18:10:44,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:44,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 18:10:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:44,787 INFO L225 Difference]: With dead ends: 298 [2019-12-07 18:10:44,787 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 18:10:44,788 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-12-07 18:10:44,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 18:10:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-12-07 18:10:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 18:10:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-12-07 18:10:44,796 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-12-07 18:10:44,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:44,796 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-12-07 18:10:44,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:44,797 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-12-07 18:10:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:10:44,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:44,798 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-12-07 18:10:44,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 18:10:44,999 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:45,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-12-07 18:10:45,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:10:45,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24512239] [2019-12-07 18:10:45,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 18:10:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:45,087 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:10:45,089 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 18:10:45,099 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:10:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 18:10:45,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24512239] [2019-12-07 18:10:45,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:45,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 18:10:45,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793586942] [2019-12-07 18:10:45,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:10:45,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:10:45,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:10:45,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:10:45,111 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 4 states. [2019-12-07 18:10:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:45,291 INFO L93 Difference]: Finished difference Result 390 states and 587 transitions. [2019-12-07 18:10:45,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:10:45,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 18:10:45,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:45,293 INFO L225 Difference]: With dead ends: 390 [2019-12-07 18:10:45,293 INFO L226 Difference]: Without dead ends: 235 [2019-12-07 18:10:45,294 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-12-07 18:10:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-12-07 18:10:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2019-12-07 18:10:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-12-07 18:10:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 323 transitions. [2019-12-07 18:10:45,307 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 323 transitions. Word has length 66 [2019-12-07 18:10:45,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:45,308 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 323 transitions. [2019-12-07 18:10:45,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:10:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 323 transitions. [2019-12-07 18:10:45,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:10:45,310 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:45,310 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-12-07 18:10:45,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 18:10:45,511 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:45,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:45,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1464883036, now seen corresponding path program 1 times [2019-12-07 18:10:45,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:10:45,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303235761] [2019-12-07 18:10:45,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 18:10:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:45,589 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:10:45,591 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 18:10:45,599 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:10:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 18:10:45,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303235761] [2019-12-07 18:10:45,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:45,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:10:45,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623940202] [2019-12-07 18:10:45,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:45,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:10:45,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:45,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:45,604 INFO L87 Difference]: Start difference. First operand 227 states and 323 transitions. Second operand 3 states. [2019-12-07 18:10:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:45,694 INFO L93 Difference]: Finished difference Result 468 states and 673 transitions. [2019-12-07 18:10:45,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:45,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 18:10:45,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:45,696 INFO L225 Difference]: With dead ends: 468 [2019-12-07 18:10:45,696 INFO L226 Difference]: Without dead ends: 250 [2019-12-07 18:10:45,696 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-12-07 18:10:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-12-07 18:10:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 246. [2019-12-07 18:10:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-07 18:10:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 347 transitions. [2019-12-07 18:10:45,705 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 347 transitions. Word has length 67 [2019-12-07 18:10:45,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:45,705 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 347 transitions. [2019-12-07 18:10:45,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 347 transitions. [2019-12-07 18:10:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 18:10:45,707 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:45,707 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, 1] [2019-12-07 18:10:45,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 18:10:45,908 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:45,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:45,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1271135886, now seen corresponding path program 1 times [2019-12-07 18:10:45,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:10:45,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478976677] [2019-12-07 18:10:45,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 18:10:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:45,992 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:10:45,994 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:46,002 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-07 18:10:46,002 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:10:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-07 18:10:46,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478976677] [2019-12-07 18:10:46,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:46,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:10:46,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148363280] [2019-12-07 18:10:46,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:46,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:10:46,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:46,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:46,009 INFO L87 Difference]: Start difference. First operand 246 states and 347 transitions. Second operand 3 states. [2019-12-07 18:10:46,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:46,087 INFO L93 Difference]: Finished difference Result 507 states and 723 transitions. [2019-12-07 18:10:46,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:46,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 18:10:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:46,088 INFO L225 Difference]: With dead ends: 507 [2019-12-07 18:10:46,088 INFO L226 Difference]: Without dead ends: 270 [2019-12-07 18:10:46,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 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-12-07 18:10:46,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-12-07 18:10:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-12-07 18:10:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-12-07 18:10:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 373 transitions. [2019-12-07 18:10:46,097 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 373 transitions. Word has length 83 [2019-12-07 18:10:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:46,098 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 373 transitions. [2019-12-07 18:10:46,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 373 transitions. [2019-12-07 18:10:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 18:10:46,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:46,099 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-12-07 18:10:46,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 18:10:46,300 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:46,300 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-12-07 18:10:46,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:10:46,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097072206] [2019-12-07 18:10:46,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 18:10:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:46,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:10:46,347 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 18:10:46,362 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:10:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 18:10:46,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097072206] [2019-12-07 18:10:46,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:46,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 18:10:46,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93746444] [2019-12-07 18:10:46,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:10:46,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:10:46,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:10:46,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:10:46,378 INFO L87 Difference]: Start difference. First operand 267 states and 373 transitions. Second operand 4 states. [2019-12-07 18:10:46,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:46,415 INFO L93 Difference]: Finished difference Result 784 states and 1095 transitions. [2019-12-07 18:10:46,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:10:46,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 18:10:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:46,417 INFO L225 Difference]: With dead ends: 784 [2019-12-07 18:10:46,417 INFO L226 Difference]: Without dead ends: 526 [2019-12-07 18:10:46,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 200 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-12-07 18:10:46,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-12-07 18:10:46,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2019-12-07 18:10:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-12-07 18:10:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 728 transitions. [2019-12-07 18:10:46,429 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 728 transitions. Word has length 102 [2019-12-07 18:10:46,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:46,429 INFO L462 AbstractCegarLoop]: Abstraction has 526 states and 728 transitions. [2019-12-07 18:10:46,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:10:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 728 transitions. [2019-12-07 18:10:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 18:10:46,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:46,430 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] [2019-12-07 18:10:46,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 18:10:46,631 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:46,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:46,632 INFO L82 PathProgramCache]: Analyzing trace with hash 302681874, now seen corresponding path program 1 times [2019-12-07 18:10:46,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:10:46,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692458843] [2019-12-07 18:10:46,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 18:10:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:46,703 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:10:46,704 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-12-07 18:10:46,717 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:10:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-12-07 18:10:46,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692458843] [2019-12-07 18:10:46,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:46,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 18:10:46,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698775619] [2019-12-07 18:10:46,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:46,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:10:46,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:46,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:46,729 INFO L87 Difference]: Start difference. First operand 526 states and 728 transitions. Second operand 3 states. [2019-12-07 18:10:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:46,753 INFO L93 Difference]: Finished difference Result 1069 states and 1477 transitions. [2019-12-07 18:10:46,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:46,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-07 18:10:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:46,757 INFO L225 Difference]: With dead ends: 1069 [2019-12-07 18:10:46,757 INFO L226 Difference]: Without dead ends: 552 [2019-12-07 18:10:46,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 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-12-07 18:10:46,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-12-07 18:10:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2019-12-07 18:10:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-12-07 18:10:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 761 transitions. [2019-12-07 18:10:46,774 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 761 transitions. Word has length 103 [2019-12-07 18:10:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:46,775 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 761 transitions. [2019-12-07 18:10:46,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 761 transitions. [2019-12-07 18:10:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 18:10:46,776 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:46,777 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-12-07 18:10:46,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 18:10:46,977 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:46,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:46,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-12-07 18:10:46,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:10:46,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200699243] [2019-12-07 18:10:46,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 18:10:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:47,022 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:10:47,024 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:47,034 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-12-07 18:10:47,034 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:10:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-12-07 18:10:47,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200699243] [2019-12-07 18:10:47,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:47,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 18:10:47,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339165621] [2019-12-07 18:10:47,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:10:47,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:10:47,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:10:47,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:10:47,046 INFO L87 Difference]: Start difference. First operand 552 states and 761 transitions. Second operand 4 states. [2019-12-07 18:10:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:47,096 INFO L93 Difference]: Finished difference Result 1519 states and 2112 transitions. [2019-12-07 18:10:47,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:10:47,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-12-07 18:10:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:47,102 INFO L225 Difference]: With dead ends: 1519 [2019-12-07 18:10:47,102 INFO L226 Difference]: Without dead ends: 1002 [2019-12-07 18:10:47,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 204 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-12-07 18:10:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-12-07 18:10:47,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2019-12-07 18:10:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-12-07 18:10:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1391 transitions. [2019-12-07 18:10:47,131 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1391 transitions. Word has length 104 [2019-12-07 18:10:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:47,132 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 1391 transitions. [2019-12-07 18:10:47,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:10:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1391 transitions. [2019-12-07 18:10:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 18:10:47,135 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:47,135 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-12-07 18:10:47,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 18:10:47,336 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:47,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:47,336 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-12-07 18:10:47,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:10:47,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912615242] [2019-12-07 18:10:47,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 18:10:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:47,396 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:10:47,398 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-12-07 18:10:47,430 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:10:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-12-07 18:10:47,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912615242] [2019-12-07 18:10:47,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:47,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 18:10:47,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360468107] [2019-12-07 18:10:47,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:10:47,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:10:47,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:10:47,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:10:47,464 INFO L87 Difference]: Start difference. First operand 1002 states and 1391 transitions. Second operand 4 states. [2019-12-07 18:10:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:47,630 INFO L93 Difference]: Finished difference Result 2090 states and 2937 transitions. [2019-12-07 18:10:47,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:10:47,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-12-07 18:10:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:47,635 INFO L225 Difference]: With dead ends: 2090 [2019-12-07 18:10:47,635 INFO L226 Difference]: Without dead ends: 1123 [2019-12-07 18:10:47,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 340 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-12-07 18:10:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-12-07 18:10:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1094. [2019-12-07 18:10:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2019-12-07 18:10:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1499 transitions. [2019-12-07 18:10:47,659 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1499 transitions. Word has length 172 [2019-12-07 18:10:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:47,659 INFO L462 AbstractCegarLoop]: Abstraction has 1094 states and 1499 transitions. [2019-12-07 18:10:47,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:10:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1499 transitions. [2019-12-07 18:10:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 18:10:47,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:47,661 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-12-07 18:10:47,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 18:10:47,862 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:47,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:47,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-12-07 18:10:47,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:10:47,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893721252] [2019-12-07 18:10:47,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 18:10:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:47,925 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:10:47,927 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 18:10:47,964 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:10:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 18:10:47,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893721252] [2019-12-07 18:10:47,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:47,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:10:48,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207465823] [2019-12-07 18:10:48,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:48,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:10:48,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:48,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:48,000 INFO L87 Difference]: Start difference. First operand 1094 states and 1499 transitions. Second operand 3 states. [2019-12-07 18:10:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:48,029 INFO L93 Difference]: Finished difference Result 2408 states and 3303 transitions. [2019-12-07 18:10:48,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:48,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-12-07 18:10:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:48,035 INFO L225 Difference]: With dead ends: 2408 [2019-12-07 18:10:48,035 INFO L226 Difference]: Without dead ends: 1349 [2019-12-07 18:10:48,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 383 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-12-07 18:10:48,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-12-07 18:10:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2019-12-07 18:10:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349 states. [2019-12-07 18:10:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1846 transitions. [2019-12-07 18:10:48,063 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1846 transitions. Word has length 193 [2019-12-07 18:10:48,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:48,063 INFO L462 AbstractCegarLoop]: Abstraction has 1349 states and 1846 transitions. [2019-12-07 18:10:48,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1846 transitions. [2019-12-07 18:10:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-12-07 18:10:48,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:48,066 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-12-07 18:10:48,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 18:10:48,267 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-12-07 18:10:48,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:10:48,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618604744] [2019-12-07 18:10:48,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 18:10:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:10:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:10:48,520 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 18:10:48,520 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:10:48,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 18:10:48,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:10:48 BoogieIcfgContainer [2019-12-07 18:10:48,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:10:48,853 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:10:48,853 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:10:48,853 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:10:48,854 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:10:43" (3/4) ... [2019-12-07 18:10:48,855 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:10:48,933 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5a38825e-1149-4aed-87c6-0997e2401bbb/bin/uautomizer/witness.graphml [2019-12-07 18:10:48,934 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:10:48,935 INFO L168 Benchmark]: Toolchain (without parser) took 6371.02 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.5 MB). Free memory was 952.4 MB in the beginning and 1.0 GB in the end (delta: -60.5 MB). Peak memory consumption was 242.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:10:48,935 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:10:48,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:10:48,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.10 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-12-07 18:10:48,936 INFO L168 Benchmark]: Boogie Preprocessor took 24.59 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-12-07 18:10:48,936 INFO L168 Benchmark]: RCFGBuilder took 403.72 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: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:10:48,936 INFO L168 Benchmark]: TraceAbstraction took 5577.09 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.3 MB). Peak memory consumption was 207.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:10:48,936 INFO L168 Benchmark]: Witness Printer took 80.58 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:10:48,937 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.59 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 403.72 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: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5577.09 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.3 MB). Peak memory consumption was 207.3 MB. Max. memory is 11.5 GB. * Witness Printer took 80.58 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. 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: 5.3s, OverallIterations: 13, TraceHistogramMax: 11, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2277 SDtfs, 1035 SDslu, 1531 SDs, 0 SdLazy, 923 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2102 GetRequests, 2086 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1349occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 52 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 1258 NumberOfCodeBlocks, 1258 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2102 ConstructedInterpolants, 0 QuantifiedInterpolants, 455437 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1661 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 3388/3388 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...